Article
Licensed
Unlicensed
Requires Authentication
A proof of the Hirsch conjecture for one class of transportation polytopes
-
M. K. KRAVTSOV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1993
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On behaviour of automata in labyrinths
- T-partitions of quasigroups and groups
- A proof of the Hirsch conjecture for one class of transportation polytopes
- Finite rings with many zero divisors
- Counter-examples to the Kotzig problem
- Russo’s formula for Poisson point fields and its applications
- The minimum of potential energy of a System of point charges
- On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
- On the asymptotic normality of the number of absent s-chains
- Some properties of planar planted trees
- Consistency of a system of random congruences
Articles in the same Issue
- On behaviour of automata in labyrinths
- T-partitions of quasigroups and groups
- A proof of the Hirsch conjecture for one class of transportation polytopes
- Finite rings with many zero divisors
- Counter-examples to the Kotzig problem
- Russo’s formula for Poisson point fields and its applications
- The minimum of potential energy of a System of point charges
- On a recursive algorithm of decoding some subsets of the first-order Reed-Muller codes
- On the asymptotic normality of the number of absent s-chains
- Some properties of planar planted trees
- Consistency of a system of random congruences