scientific article; zbMATH DE number 3989108
From MaRDI portal
Publication:3751378
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
(37)- A new dominance procedure for combinatorial optimization problems
- A multi-product loading problem: A model and solution method
- Pseudopolynomial algorithms for the solution of backpack problems
- 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
- An incentive dynamic programming method for the optimization of scholarship assignment
- The linear complementarity problem as a separable bilinear program
- A typology of cutting and packing problems
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Options as silver bullets: valuation of term loans, inventory management, emissions trading and insurance risk mitigation using option theory
- Optimal experimental design for combinatorial problems
- Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Tree knapsack approaches for local access network design
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- Algorithms for some hard knapsack problems
- Algorithms for packing problems
- Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- The unbounded knapsack problem
- scientific article; zbMATH DE number 432989 (Why is no real title available?)
- scientific article; zbMATH DE number 3847214 (Why is no real title available?)
- A survey of effective heuristics and their application to a variety of knapsack problems
- Realization of knapsack problem solving algorithm and some of its applications
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
- A New Algorithm for the Solution of the Knapsack Problem
- An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- Tight bounds for online class-constrained packing
- Automated QoS-aware service selection based on soft constraints
- An improved FPTAS for budgeted laminar matroid independent set
- Handling sub-symmetry in integer programming using activation handlers
- Overcoming poor data quality: optimizing validation of precedence relation data
- 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
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)
