Local cuts revisited
From MaRDI portal
Publication:1003489
DOI10.1016/J.ORL.2008.01.004zbMATH Open1155.90480OpenAlexW2053375152MaRDI QIDQ1003489FDOQ1003489
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
Cited In (11)
- Engineering branch-and-cut algorithms for the equicut problem
- Lifting and separation procedures for the cut polytope
- Reformulating the disjunctive cut generating linear program
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Optimal patchings for consecutive ones matrices
- Target cuts from relaxed decision diagrams
- Local cuts for mixed-integer programming
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Partial hyperplane activation for generalized intersection cuts
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
Uses Software
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)