On Linear Characterizations of Combinatorial Optimization Problems
- 1 November 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (4) , 620-632
- https://doi.org/10.1137/0211053
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- On the symmetric travelling salesman problem II: Lifting theorems and facetsMathematical Programming, 1979
- On the symmetric travelling salesman problem I: InequalitiesMathematical Programming, 1979
- On the Computational Complexity of Integer Programming ProblemsPublished by Springer Nature ,1978
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976
- Facets of the knapsack polytopeMathematical Programming, 1975
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954