Cutting planes for integer programs with general integer variables

DOI10.1007/BF01581105zbMath0919.90113OpenAlexW2046300504MaRDI QIDQ1290616

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

zbMATH Keywords

integer programmingliftingbranch-and-boundcutting planescover inequalitiescut-and-branchGomory mixed integer cutsknapsack inequalities

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Knapsack polytopes: a survey, A hybrid approach for biobjective optimization, An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane, Multistage robust discrete optimization via quantified integer programming, Integer programming solution approach for inventory‐production–distribution problems with direct shipments, Constrained integer fractional programming problem with box constraints, Lifting for the integer knapsack cover polyhedron, A polyhedral study of the semi-continuous knapsack problem, Classical cuts for mixed-integer programming and branch-and-cut, Solving the facility location and fixed charge solid transportation problem, Cutting planes in integer and mixed integer programming, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, A framework for constructing general integer problems with well-determined duality gaps, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, A cutting-plane approach to mixed 0-1 stochastic integer programs, Cover and pack inequalities for (mixed) integer programming

Uses Software

• MIPLIB
• CPLEX

Cites Work

• Unnamed Item
• On the \(0/1\) knapsack polytope
• Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Gomory cuts revisited
• Solving Large-Scale Zero-One Linear Programming Problems
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• On the facial structure of set packing polyhedra
• Shortest paths, single origin‐destination network design, and associated polyhedra