Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

DOI10.1007/S10479-007-0171-7zbMath1157.90488OpenAlexW2100189126MaRDI QIDQ5920488

Quentin Louveaux, Laurence A. Wolsey

Publication date: 31 March 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0171-7

zbMATH Keywords

liftingmixed integer roundingsingle node flow sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (12)

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ Cutting planes for the multistage stochastic unit commitment problem ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ Valid inequalities for mixed-integer programmes with fixed charges on sets of variables ⋮ Lifting, tilting and fractional programming revisited ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ Lifting for conic mixed-integer programming ⋮ Sequence independent lifting for mixed knapsack problems with GUB constraints ⋮ Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms ⋮ Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets ⋮ A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints ⋮ The impact of distribution system characteristics on computational tractability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Valid inequalities for mixed 0-1 programs
• Submodularity and valid inequalities in capacitated fixed charge networks
• Cutting planes for integer programs with general integer variables
• The 0-1 knapsack problem with a single continuous variable
• The complementary class of generalized flow cover inequalities
• On the polyhedral structure of a multi-item production planning model with setup times
• A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
• Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
• On the facets of the mixed-integer knapsack polyhedron
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• A study of the lot-sizing polytope
• Sequence independent lifting in mixed integer programming
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Solving Large-Scale Zero-One Linear Programming Problems
• Valid Linear Inequalities for Fixed Charge Problems
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes
• Facets of the knapsack polytope
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• An Introduction to the Theory of Cutting-Planes
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• On the facial structure of set packing polyhedra
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Flow pack facets of the single node fixed-charge flow polytope
• Valid inequalities for problems with additive variable upper bounds

This page was built for publication: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited