TSP Cuts Which Do Not Conform to the Template Paradigm
- 19 November 2001
- book chapter
- Published by Springer Science and Business Media LLC
- p. 261-303
- https://doi.org/10.1007/3-540-45586-8_7
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- Generating Fenchel Cutting Planes for Knapsack PolyhedraSIAM Journal on Optimization, 1993
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSiam Review, 1991
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- A cutting plane procedure for the travelling salesman problem on road networksEuropean Journal of Operational Research, 1985
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Science and Business Media LLC ,1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Science and Business Media LLC ,1980
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958