Sequence independent lifting in mixed integer programming
From MaRDI portal
Publication:1977865
DOI10.1023/A:1009841107478zbMath0964.90030MaRDI QIDQ1977865
Nemhauser, George I., Savelsbergh, Martin W. P., Zonghao Gu
Publication date: 19 July 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Related Items
Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Cutting planes in integer and mixed integer programming, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Cover and pack inequalities for (mixed) integer programming, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Lifting two-integer knapsack inequalities, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Valid inequalities for mips and group polyhedra from approximate liftings, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, On a generalization of the master cyclic group polyhedron, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Polyhedral description of the integer single node flow set with constant bounds, Sequence independent lifting for mixed integer programs with variable upper bounds, Separation algorithms for 0-1 knapsack polytopes
