On the knapsack closure of 0-1 integer linear programs
From MaRDI portal
Publication:2861491
zbMATH Open1274.90240MaRDI QIDQ2861491FDOQ2861491
Authors: Matteo Fischetti, Andrea Lodi 
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001022
Recommendations
- Cover and pack inequalities for (mixed) integer programming
- Separation algorithms for 0-1 knapsack polytopes
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- The 0-1 knapsack problem with a single continuous variable
- On the \(0/1\) knapsack polytope
Cites Work
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Some polyhedra related to combinatorial problems
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- How tight is the corner relaxation?
- Gomory integer programs
- On the Exact Separation of Mixed Integer Knapsack Cuts
- Extended formulations for Gomory corner polyhedra
- Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
Cited In (10)
- On a generalization of the Chvátal-Gomory closure
- On a generalization of the Chvátal-Gomory closure
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- How tight is the corner relaxation?
- On the exact separation of mixed integer knapsack cuts
- The strength of multi-row aggregation cuts for sign-pattern integer programs
- Mixed-integer programming for cycle detection in nonreversible Markov processes
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- The aggregation closure is polyhedral for packing and covering integer programs
- On polytopes with linear rank with respect to generalizations of the split closure
This page was built for publication: On the knapsack closure of 0-1 integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861491)
