On disjunctive cuts for combinatorial optimization

DOI10.1023/A:1011493126498zbMath1078.90039OpenAlexW1578768378WikidataQ57702383 ScholiaQ57702383MaRDI QIDQ5952319

Adam N. Letchford

Publication date: 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011493126498

zbMATH Keywords

integer programmingset covering problemcutting planesasymmetric travelling salesman problemmax-cut problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (13)

The matching relaxation for a class of generalized set partitioning problems ⋮ Generalised 2-circulant inequalities for the max-cut problem ⋮ A note on the 2-circulant inequalities for the MAX-cut problem ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ Constraint qualification failure in action ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Tightening simple mixed-integer sets with guaranteed bounds ⋮ Facets from gadgets ⋮ A two-level graph partitioning problem arising in mobile wireless communications ⋮ Projection results for the \(k\)-partition problem ⋮ A new separation algorithm for the Boolean quadric and cut polytopes ⋮ Approximate fixed-rank closures of covering problems ⋮ Projection, lifting and extended formulation integer and combinatorial optimization

This page was built for publication: On disjunctive cuts for combinatorial optimization