Facet Generating Techniques

DOI10.1007/978-3-540-76796-1_2zbMath1359.90113OpenAlexW6806899MaRDI QIDQ2971603

Sylvia Boyd, William R. Pulleyblank

Publication date: 7 April 2017

Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_2

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

More facets from fences for linear ordering and acyclic subgraph polytopes, On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure, When the Gomory-chvátal closure coincides with the integer hull, Facet Generating Techniques, Sensitivity theorems in integer linear programming, Extended formulations for order polytopes through network flows, The strongest facets of the acyclic subgraph polytope are unknown, On the complexity of cutting-plane proofs, On the rational polytopes with Chvátal rank 1, Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank, Cutting-plane proofs in polynomial space, Optimizing over the subtour polytope of the travelling salesman problem

Uses Software

• MIPLIB
• MIPLIB2003

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing over the subtour polytope of the travelling salesman problem
• Optimizing over the first Chvátal closure
• Brick decompositions and the matching rank of graphs
• On the membership problem for the elementary closure of a polyhedron
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Two-edge connected spanning subgraphs and polyhedra
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope
• Edmonds polytopes and a hierarchy of combinatorial problems
• Facet Generating Techniques
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• On the symmetric travelling salesman problem I: Inequalities
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• On the acyclic subgraph polytope
• Facets of the linear ordering polytope
• Sensitivity theorems in integer linear programming
• On Cutting Planes
• Odd Minimum Cut-Sets and b-Matchings
• Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
• An Integer Polytope Related to the Design of Survivable Communication Networks
• The Circuit Polytope: Facets