Local cuts revisited
From MaRDI portal
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
- scientific article; zbMATH DE number 1982172 (Why is no real title available?)
- scientific article; zbMATH DE number 2084783 (Why is no real title available?)
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- Corner polyhedra and their connection with cutting planes
- Not Every GTSP Facet Induces an STSP Facet
Cited in
(11)- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Lifting and separation procedures for the cut polytope
- Engineering branch-and-cut algorithms for the equicut problem
- 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
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)