On disjunctive cuts for combinatorial optimization

DOI10.1023/A:1011493126498MaRDI QIDQ5952319zbMATH OpenOpenAlexWikidataFDO

Authors 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

asymmetric travelling salesman problemcutting planesinteger programmingmax-cut problemset covering problem

Mathematics Subject Classification ID

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

Recommendations

• Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
• Facet inequalities from simple disjunctions in cutting plane theory
• On the separation of disjunctive cuts
• scientific article; zbMATH DE number 1187158
• Polyhedral techniques in combinatorial optimization II: applications and computations

Cited in

(37)

• A disjunctive cutting plane algorithm for the extreme point mathematical programming problem
• 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
• On cutting planes for cardinality-constrained linear programs
• A new separation algorithm for the Boolean quadric and cut polytopes
• Cutting planes from wide split disjunctions
• A note on the 2-circulant inequalities for the MAX-cut problem
• Coordinated cutting plane generation via multi-objective separation
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• Disjunctive cuts for continuous linear bilevel programming
• A convex-analysis perspective on disjunctive cuts
• Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality
• Approximate fixed-rank closures of covering problems
• Generalised 2-circulant inequalities for the max-cut problem
• Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
• Disjunctive Cuts for Nonconvex MINLP
• Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
• scientific article; zbMATH DE number 3856823 (Why is no real title available?)
• An in-out approach to disjunctive optimization
• Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
• Facet inequalities from simple disjunctions in cutting plane theory
• Tightening simple mixed-integer sets with guaranteed bounds
• scientific article; zbMATH DE number 1757966 (Why is no real title available?)
• Intersection cuts from multiple rows: a disjunctive programming approach
• Reflections on generating (disjunctive) cuts
• scientific article; zbMATH DE number 780782 (Why is no real title available?)
• scientific article; zbMATH DE number 7525500 (Why is no real title available?)
• A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
• Target cuts from relaxed decision diagrams
• On the separation of disjunctive cuts
• A note on characterizing canonical cuts using geometry
• Easy and hard separation of sparse and dense odd-set constraints in matching
• Projection, lifting and extended formulation integer and combinatorial optimization
• Computing deep facet-defining disjunctive cuts for mixed-integer programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952319)