Valid inequalities for mixed 0-1 programs
Discrete Applied Mathematics
Solving mixed integer programming problems using automatic reformulation
Operations Research
Integer and combinatorial optimization
Integer and combinatorial optimization
Polyhedral results for the precedence-constrained knapsack problem
Discrete Applied Mathematics
Lifting cover inequalities for the precedence-constrained knapsack problem
Discrete Applied Mathematics
Lifted Cover Inequalities for 0-1 Integer Programs: Computation
INFORMS Journal on Computing
Sequence Independent Lifting for Mixed-Integer Programming
Operations Research
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters
Flow pack facets of the single node fixed-charge flow polytope
Operations Research Letters
Hi-index | 0.00 |
In this paper, we present a systematic method to derive strong superadditive approximations of multidimensional lifting functions using single-dimensional superadditive functions. This constructive approach is based on the observation that, in many cases, the lifting function of a multidimensional problem can be expressed or approximated through the single-dimensional lifting function of some of its components. We then apply our approach to two variants of classical models and show that it yields an efficient procedure to derive strong valid inequalities.