Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints

DOI10.1007/978-3-319-07557-0_6zbMATH Open1418.90211OpenAlexW186014687MaRDI QIDQ5418985FDOQ5418985

Authors: A. Angulo, Rodrigo Palma, Daniel G. Espinoza 

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_6

Recommendations

• Sequence independent lifting for mixed knapsack problems with GUB constraints
• A polyhedral study of the semi-continuous knapsack problem
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes

zbMATH Keywords

knapsack problemgeneralized upper boundssequence independent multidimensional lifting

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (2)

• Sequence independent lifting for mixed knapsack problems with GUB constraints
• A polyhedral study of the semi-continuous knapsack problem

This page was built for publication: Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418985)