Cutting planes for integer programs with general integer variables
From MaRDI portal
Publication:1290616
DOI10.1007/BF01581105zbMATH Open0919.90113OpenAlexW2046300504MaRDI QIDQ1290616FDOQ1290616
Authors: Sebastián Ceria, Cécile Cordier, Hugues Marchand, Laurence A. Wolsey 
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581105
Recommendations
integer programmingcutting planescover inequalitiesliftingbranch-and-boundcut-and-branchGomory mixed integer cutsknapsack inequalities
Cites Work
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Gomory cuts revisited
- Solving Large-Scale Zero-One Linear Programming Problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On the facial structure of set packing polyhedra
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Title not available (Why is that?)
- On the \(0/1\) knapsack polytope
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Shortest paths, single origin‐destination network design, and associated polyhedra
Cited In (33)
- Solving the facility location and fixed charge solid transportation problem
- Fenchel Cutting Planes for Integer Programs
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Lifting for the integer knapsack cover polyhedron
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Knapsack polytopes: a survey
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Local cuts for mixed-integer programming
- A computational comparison of Gomory and knapsack cuts
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- A hybrid approach for biobjective optimization
- Multistage robust discrete optimization via quantified integer programming
- Completeness of cutting planes revisited
- Cover and pack inequalities for (mixed) integer programming
- Cutting planes for multistage stochastic integer programs
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Cutting planes in integer and mixed integer programming
- A surrogate cutting plane algorithm for all-integer programming
- Generating cuts in integer programming with families of special ordered sets
- Constrained integer fractional programming problem with box constraints
- A polyhedral study of the semi-continuous knapsack problem
- On the redundancy of cutting planes for linear complementarity problems
- A framework for constructing general integer problems with well-determined duality gaps
- Computational Integer Programming and Cutting Planes
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Classical cuts for mixed-integer programming and branch-and-cut
Uses Software
This page was built for publication: Cutting planes for integer programs with general integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290616)
