Signature classes of transportation polytopes
- 1 June 1993
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 60 (1), 127-144
- https://doi.org/10.1007/bf01580606
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The monotonic diameter of the perfect matching and shortest path polytopesOperations Research Letters, 1992
- Maximum matchings in bipartite graphs via strong spanning treesNetworks, 1991
- A relaxation column signature method for assignment problemsEuropean Journal of Operational Research, 1991
- Sparse dual transportation polyhedra: Extreme points and signaturesOperations Research Letters, 1990
- A competitive (dual) simplex method for the assignment problemMathematical Programming, 1986
- Efficient dual simplex algorithms for the assignment problemMathematical Programming, 1985
- On the Assignment PolytopeSiam Review, 1974
- On two special classes of transportation polytopesPublished by Springer Science and Business Media LLC ,1974
- Transportation polytopesJournal of Combinatorial Theory, Series B, 1972
- Paths on Polyhedra. IJournal of the Society for Industrial and Applied Mathematics, 1965