Polyhedral Combinatorics
- 1 January 1983
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 63 references indexed in Scilit:
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Polynomial Algorithms for Totally Dual Integral Systems and ExtensionsPublished by Elsevier ,1981
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Theoretical Properties of the Network Simplex MethodMathematics of Operations Research, 1979
- A primal algorithm for optimum matchingPublished by Springer Nature ,1978
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- On the Set-Covering ProblemOperations Research, 1972
- Establishing the matching polytopeJournal of Combinatorial Theory, Series B, 1972
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954