The following pages link to Local cuts revisited (Q1003489):
Displayed 10 items.
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Target Cuts from Relaxed Decision Diagrams (Q5138261) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)