scientific article; zbMATH DE number 3989108
zbMATH Open0611.90078MaRDI QIDQ3751378FDOQ3751378
Authors: Silvano Martello, Paolo Toth 
Publication date: 1987
Title of this publication is not available (Why is that?)
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
computational experimentsknapsack problemsupper boundsrelaxationsreduction proceduresexact and approximate algorithmssubset-sumextensive surveymultiple knapsack
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)
Cited In (31)
- Title not available (Why is that?)
- An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- Automated QoS-aware service selection based on soft constraints
- A multi-product loading problem: A model and solution method
- Tight bounds for online class-constrained packing
- A New Algorithm for the Solution of the Knapsack Problem
- Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
- Realization of knapsack problem solving algorithm and some of its applications
- A new dominance procedure for combinatorial optimization problems
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- An incentive dynamic programming method for the optimization of scholarship assignment
- The linear complementarity problem as a separable bilinear program
- Optimal experimental design for combinatorial problems
- Tree knapsack approaches for local access network design
- The selective travelling salesman problem
- Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- Algorithms for some hard knapsack problems
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Pseudopolynomial algorithms for the solution of backpack problems
- An exact algorithm for large unbounded knapsack problems
- A typology of cutting and packing problems
- 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
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- A survey of effective heuristics and their application to a variety of knapsack problems
- A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
- Title not available (Why is that?)
- Qos-aware service evaluation and selection
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
- Algorithms for packing problems
- Title not available (Why is that?)
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)
