On the exact separation of mixed integer knapsack cuts
From MaRDI portal
Publication:543396
DOI10.1007/s10107-009-0284-7zbMath1218.90126OpenAlexW2051496747MaRDI QIDQ543396
Marcos Goycoolea, Ricardo Fukasawa
Publication date: 17 June 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0284-7
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (17)
Knapsack polytopes: a survey ⋮ Intersection cuts for single row corner relaxations ⋮ Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem ⋮ An implementation of exact knapsack separation ⋮ Theoretical challenges towards cutting-plane selection ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ The strength of multi-row models ⋮ The strength of multi-row aggregation cuts for sign-pattern integer programs ⋮ Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable ⋮ Multi-cover inequalities for totally-ordered multiple knapsack sets ⋮ The aggregation closure is polyhedral for packing and covering integer programs ⋮ On a generalization of the Chvátal-Gomory closure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing over the first Chvátal closure
- Chvátal closures for mixed integer programming problems
- On the strength of Gomory mixed-integer cuts as group cuts
- A computational study of exact knapsack separation for the generalized assignment problem
- A new dominance procedure for combinatorial optimization problems
- Cutting planes for mixed-integer knapsack polyhedra
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- On the facets of the mixed-integer knapsack polyhedron
- Unbounded knapsack problem: Dynamic programming revisited
- A linear algorithm for integer programming in the plane
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Sequence independent lifting in mixed integer programming
- Exact solutions to linear programming problems
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Separation algorithms for 0-1 knapsack polytopes
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Early Integer Programming
- Sequence Independent Lifting for Mixed-Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- Lifting the facets of zero–one polytopes
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- Computing Partitions with Applications to the Knapsack Problem
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Facets of the Knapsack Polytope From Minimal Covers
- Fenchel Cutting Planes for Integer Programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- On the MIR Closure of Polyhedra
- Some continuous functions related to corner polyhedra
- Benchmarking optimization software with performance profiles.
This page was built for publication: On the exact separation of mixed integer knapsack cuts
