scientific article; zbMATH DE number 3900494
From MaRDI portal
Publication:3678962
Recommendations
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- 0-1 knapsack problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Some computational results on real 0-1 knapsack problems
Cited in
(24)- A hybrid algorithm for the unbounded knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- A new enumeration scheme for the knapsack problem
- Some thoughts on combinatorial optimisation
- A minimal algorithm for the multiple-choice knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Two linear approximation algorithms for the subset-sum problem
- Bridging game theory and the knapsack problem: a theoretical formulation
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Hybrid rounding techniques for knapsack problems
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- A dynamic programming algorithm for the knapsack problem with setup
- scientific article; zbMATH DE number 5733022 (Why is no real title available?)
- scientific article; zbMATH DE number 1754727 (Why is no real title available?)
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
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 Q3678962)
