Polyhedral techniques in combinatorial optimization I: Theory
From MaRDI portal
Publication:4715790
DOI10.1111/j.1467-9574.1996.tb01478.xzbMath0858.90105OpenAlexW2165517980MaRDI QIDQ4715790
Stan P. M. van Hoesel, Karen Aardal
Publication date: 18 November 1996
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/8626b6f9-efb0-4ae5-8011-30e119ebb5ab
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items
The Boolean Quadric Polytope, On the 2-Club Polytope of Graphs, Theory and methods of Euclidian combinatorial optimization: current status and prospects, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Branch and cut methods for network optimization, Decomposition and dynamic cut generation in integer linear programming, Graphs and Algorithms in Communication Networks on Seven League Boots, A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements, A framework for generalized Benders' decomposition and its application to multilevel optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of cutting-plane proofs
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Total dual integrality and integer polyhedra
- Solution of large-scale symmetric travelling salesman problems
- Facet identification for the symmetric traveling salesman polytope
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Matrices with the Edmonds-Johnson property
- Decomposition of regular matroids
- On total dual integrality
- The ellipsoid method and its consequences in combinatorial optimization
- On a conjecture of Fejes Toth
- A linear description of the discrete lot-sizing and scheduling problem
- MINTO, a Mixed INTeger Optimizer
- Edmonds polytopes and a hierarchy of combinatorial problems
- On the symmetric travelling salesman problem I: Inequalities
- Outline of an algorithm for integer solutions to linear programs
- Uncapacitated lot-sizing: The convex hull of solutions
- Sensitivity theorems in integer linear programming
- (1,k)-configurations and facets for packing problems
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- On Cutting Planes
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- The Graphs with All Subgraphs T-Perfect
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Capacitated Facility Location: Valid Inequalities and Facets
