Branch and cut methods for network optimization
Authors:
- 1 February 2001
- journal article
- Published by Elsevier in Mathematical and Computer Modelling
- Vol. 33 (4-5) , 517-532
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Polyhedral techniques in combinatorial optimization II: applications and computationsStatistica Neerlandica, 1999
- A Branch-and-Price Algorithm for the Generalized Assignment ProblemOperations Research, 1997
- Solution of large-scale symmetric travelling salesman problemsMathematical Programming, 1991
- Small Travelling Salesman PolytopesMathematics of Operations Research, 1991
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- A new class of cutting planes for the symmetric travelling salesman problemMathematical Programming, 1988
- Clique Tree Inequalities and the Symmetric Travelling Salesman ProblemMathematics of Operations Research, 1986
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Edmonds polytopes and weakly hamiltonian graphsMathematical Programming, 1973
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965