Subadditive lifting methods for partitioning and knapsack problems
From MaRDI portal
Publication:3877407
DOI10.1016/0196-6774(80)90006-1zbMath0436.90074MaRDI QIDQ3877407
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
partitioning; covering; dynamic programming; duality; packing; knapsack problem; subadditive function; branch-and- bound; implementations; dual simplex algorithm; single equality constraint; group approach; shortest path methods; dual feasible subadditive lifting methods; knapsack-partitioning problem; subadditive lifting methods
Related Items
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Two-stage quadratic integer programs with stochastic right-hand sides, 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