Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
From MaRDI portal
Publication:1424281
DOI10.1007/s10107-003-0398-2zbMath1047.90033OpenAlexW2112538451MaRDI QIDQ1424281
Jean-Philippe P. Richard, Nemhauser, George I., Ismael Regis jun. de Farias
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0398-2
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)
Related Items
Knapsack polytopes: a survey, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Partial objective inequalities for the multi-item capacitated lot-sizing problem, A computational analysis of lower bounds for big bucket production planning problems, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Lifting for the integer knapsack cover polyhedron, Lifting for conic mixed-integer programming, A polyhedral study of the semi-continuous knapsack problem, Optimization methods for mixed integer weakly concave programming problems, Multi-commodity variable upper bound flow models, The continuous knapsack set, The strength of multi-row models, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for mips and group polyhedra from approximate liftings, Lifting for mixed integer programs with variable upper bounds, A polyhedral approach to least cost influence maximization in social networks, Cover and pack inequalities for (mixed) integer programming, Continuous knapsack sets with divisible capacities
