A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem

@article{Balev2008ADP,
  title={A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem},
  author={Stefan Balev and Nicola Yanev and Arnaud Fr{\'e}ville and Rumen Andonov},
  journal={European Journal of Operational Research},
  year={2008},
  volume={186},
  pages={63-76}
}

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

Capacity allocation problem with random demands for the rail container carrier

European Journal of Operational Research • 2012
View 4 Excerpts
Highly Influenced

BPSOBDE: A Binary Version of Hybrid Heuristic Algorithm for Multidimensional Knapsack Problems

2017 13th International Conference on Computational Intelligence and Security (CIS) • 2017
View 1 Excerpt

Migrating Birds Optimization (MBO) algorithm to solve 0-1 multidimensional knapsack problem

2017 International Conference on Computer Science and Engineering (UBMK) • 2017
View 2 Excerpts

Multidimensional 0–1 Knapsack using directed Bee Colony algorithm

2017 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS) • 2017
View 1 Excerpt

Similar Papers

Loading similar papers…