Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds

DOI10.1016/0167-6377(89)90016-3zbMath0682.90068OpenAlexW2055859144MaRDI QIDQ1824557

Michel X. Goemans

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90016-3

zbMATH Keywords

fixed chargescutting plane algorithmseparation problemconvex hull of regionsdual-based heuristicfacet-defining valid inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Boolean programming (90C09) Polytopes and polyhedra (52Bxx)

Related Items (6)

Lifted Euclidean inequalities for the integer single node flow set with upper bounds ⋮ Lifting, superadditivity, mixed integer rounding and single node flow sets revisited ⋮ Knapsack problems with setups ⋮ Polyhedral description of the integer single node flow set with constant bounds ⋮ Sequence independent lifting for mixed integer programs with variable upper bounds ⋮ Lifting for mixed integer programs with variable upper bounds

Cites Work

• Unnamed Item
• Valid inequalities for mixed 0-1 programs
• Valid inequalities and separation for capacitated economic lot sizing
• Facets and algorithms for capacitated lot sizing
• Uncapacitated lot-sizing: The convex hull of solutions
• Valid Linear Inequalities for Fixed Charge Problems
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Faces for a linear inequality in 0–1 variables
• Facets of the knapsack polytope
• Covering, Packing and Knapsack Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• On Linear Characterizations of Combinatorial Optimization Problems

This page was built for publication: Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds