Local cuts revisited
From MaRDI portal
Publication:1003489
DOI10.1016/j.orl.2008.01.004zbMath1155.90480MaRDI 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
integer programming; traveling salesman problem; cutting plane separation; local cuts; project-and-lift
Related Items
Target Cuts from Relaxed Decision Diagrams, A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems, Lifting and separation procedures for the cut polytope, Reformulating the disjunctive cut generating linear program, 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
Uses Software
Cites Work