Subadditive lifting methods for partitioning and knapsack problems

DOI10.1016/0196-6774(80)90006-1MaRDI QIDQ3877407zbMATH OpenOpenAlexFDO

Authors Ellis L. Johnson

Publication date 1980

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(80)90006-1

zbMATH Keywords

branch-and- boundcoveringdual feasible subadditive lifting methodsdual simplex algorithmdualitydynamic programminggroup approachimplementationsknapsack problemknapsack-partitioning problempackingpartitioningshortest path methodssingle equality constraintsubadditive functionsubadditive lifting methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(5)

• On cutting-plane proofs in combinatorial optimization
• Subadditive approaches in integer programming
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
• Two-stage quadratic integer programs with stochastic right-hand sides
• The gap function: evaluating integer programming models over multiple right-hand sides

This page was built for publication: Subadditive lifting methods for partitioning and knapsack problems

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