Facets from gadgets
From MaRDI portal
Publication:2220662
DOI10.1007/s10107-019-01430-yzbMath1458.90640OpenAlexW2973141906WikidataQ127252877 ScholiaQ127252877MaRDI QIDQ2220662
Publication date: 25 January 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/136540/1/gadgets.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facets of the clique partitioning polytope
- Matrices with the Edmonds-Johnson property
- Geometric algorithms and combinatorial optimization
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Wheel inequalities for stable set polytopes
- Set packing relaxations of some integer programs
- Antiweb-wheel inequalities and their separation problems over the stable set polytopes
- Implementing an efficient minimum capacity cut algorithm
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- On the partial order polytope of a digraph
- The partition problem
- Exploring the relationship between max-cut and stable set relaxations
- Edmonds polytopes and a hierarchy of combinatorial problems
- Integer Programming
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Odd Minimum Cut Sets and b-Matchings Revisited
- Facets of the linear ordering polytope
- Odd Minimum Cut-Sets and b-Matchings
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Clique-Web Facets for Multicut Polytopes
- Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
- Gadgets, Approximation, and Linear Programming
- On the cut polytope
- Transitive Packing: A Unifying Concept in Combinatorial Optimization
- On the facial structure of set packing polyhedra
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
- Fibonacci heaps and their uses in improved network optimization algorithms
- Solution of a Large-Scale Traveling-Salesman Problem
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
- The complexity of theorem-proving procedures
- On disjunctive cuts for combinatorial optimization
