Local cuts revisited

DOI10.1016/j.orl.2008.01.004zbMath1155.90480OpenAlexW2053375152MaRDI QIDQ1003489

Frauke Liers, Marcus Oswald, Christoph Buchheim

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

integer programmingtraveling salesman problemcutting plane separationlocal cutsproject-and-lift

Mathematics Subject Classification ID

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

Related Items (10)

Optimal patchings for consecutive ones matrices ⋮ Reformulating the disjunctive cut generating linear program ⋮ Speeding up IP-based algorithms for constrained quadratic 0-1 optimization ⋮ Local cuts for mixed-integer programming ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ Lifting and separation procedures for the cut polytope ⋮ A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations ⋮ Engineering Branch-and-Cut Algorithms for the Equicut Problem

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Corner polyhedra and their connection with cutting planes
• Not Every GTSP Facet Induces an STSP Facet
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut

This page was built for publication: Local cuts revisited