scientific article; zbMATH DE number 3989108

MaRDI QIDQ3751378zbMATH OpenFDO

Authors Silvano Martello, Paolo Toth

Publication date 1987

zbMATH Keywords

computational experimentsknapsack problemsupper boundsrelaxationsreduction proceduresexact and approximate algorithmssubset-sumextensive surveymultiple knapsack

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Algorithms for some hard knapsack problems
• scientific article; zbMATH DE number 3889280
• An algorithm for solving a class of knapsack problems and its generalization
• Core problems in knapsack algorithms
• scientific article; zbMATH DE number 1302173
• A New Algorithm for the Solution of the Knapsack Problem
• scientific article; zbMATH DE number 4093181
• Algorithms for the bounded set-up knapsack problem
• Exact Algorithms For The Setup Knapsack Problem

Cited in

(33)

• A typology of cutting and packing problems
• A new dominance procedure for combinatorial optimization problems
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A multi-product loading problem: A model and solution method
• Pseudopolynomial algorithms for the solution of backpack problems
• The unbounded knapsack problem
• A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
• Tree knapsack approaches for local access network design
• An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
• An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
• The selective travelling salesman problem
• An incentive dynamic programming method for the optimization of scholarship assignment
• Optimal experimental design for combinatorial problems
• scientific article; zbMATH DE number 432989 (Why is no real title available?)
• The linear complementarity problem as a separable bilinear program
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
• Options as silver bullets: valuation of term loans, inventory management, emissions trading and insurance risk mitigation using option theory
• A survey of effective heuristics and their application to a variety of knapsack problems
• Tight bounds for online class-constrained packing
• Algorithms for packing problems
• Qos-aware service evaluation and selection
• Algorithms for some hard knapsack problems
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
• scientific article; zbMATH DE number 3847214 (Why is no real title available?)
• Realization of knapsack problem solving algorithm and some of its applications
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
• Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
• Automated QoS-aware service selection based on soft constraints
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• A New Algorithm for the Solution of the Knapsack Problem
• An exact algorithm for large unbounded knapsack problems

This page was built for publication:

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