Local cuts revisited

DOI10.1016/J.ORL.2008.01.004MaRDI QIDQ1003489zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, F. Liers, Marcus Oswald

Publication date 4 March 2009

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2008.01.004

zbMATH Keywords

cutting plane separationinteger programminglocal cutsproject-and-lifttraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Local cuts for mixed-integer programming
• A modified lift-and-project procedure
• Facet inequalities from simple disjunctions in cutting plane theory
• New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
• General cut-generating procedures for the stable set polytope

Cites work

• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• Corner polyhedra and their connection with cutting planes
• scientific article; zbMATH DE number 1982172 (Why is no real title available?)
• scientific article; zbMATH DE number 2084783 (Why is no real title available?)
• Not Every GTSP Facet Induces an STSP Facet

Cited in

(14)

• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
• Optimal patchings for consecutive ones matrices
• Partial hyperplane activation for generalized intersection cuts
• Local cuts for mixed-integer programming
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• Engineering branch-and-cut algorithms for the equicut problem
• Lifting and separation procedures for the cut polytope
• Target cuts from relaxed decision diagrams
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
• An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
• \(\mathcal{V}\)-polyhedral disjunctive cuts
• Vehicle routing problem with time windows -- new valid inequalities from polar duality
• On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
• Reformulating the disjunctive cut generating linear program

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Local cuts revisited

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