Publication:3751378
From MaRDI portal
zbMath0611.90078MaRDI QIDQ3751378
Publication date: 1987
upper bounds; computational experiments; knapsack problems; relaxations; reduction procedures; exact and approximate algorithms; subset-sum; extensive survey; multiple knapsack
90C10: Integer programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Tight bounds for online class-constrained packing, The selective travelling salesman problem, An exact algorithm for large unbounded knapsack problems, Qos-aware service evaluation and selection, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, A new dominance procedure for combinatorial optimization problems, A multi-product loading problem: A model and solution method, An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks, An expanding-core algorithm for the exact \(0-1\) knapsack problem, The linear complementarity problem as a separable bilinear program, A typology of cutting and packing problems, Optimal experimental design for combinatorial problems, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Tree knapsack approaches for local access network design
