On disjunctive cuts for combinatorial optimization

DOI10.1023/A:1011493126498zbMath1078.90039MaRDI 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 programming; set covering problem; cutting planes; asymmetric travelling salesman problem; max-cut problem

Mathematics Subject Classification ID

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

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