scientific article
From MaRDI portal
Publication:3751378
zbMath0611.90078MaRDI QIDQ3751378
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
upper boundscomputational experimentsknapsack problemsrelaxationsreduction proceduresexact and approximate algorithmssubset-sumextensive surveymultiple knapsack
Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Optimal experimental design for combinatorial problems, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, Computational complexity analysis of set membership identification of Hammerstein and Wiener systems, A new dominance procedure for combinatorial optimization problems, An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks, Tight bounds for online class-constrained packing, Options as silver bullets: valuation of term loans, inventory management, emissions trading and insurance risk mitigation using option theory, An expanding-core algorithm for the exact \(0-1\) knapsack problem, The selective travelling salesman problem, An exact algorithm for large unbounded knapsack problems, An incentive dynamic programming method for the optimization of scholarship assignment, Qos-aware service evaluation and selection, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Tree knapsack approaches for local access network design, The linear complementarity problem as a separable bilinear program, A multi-product loading problem: A model and solution method, A typology of cutting and packing problems
