Heuristics for the 0–1 multidimensional knapsack problem-Reference-Cited by-同舟云学术

Heuristics for the 0–1 multidimensional knapsack problem

Published:2009-12 Issue:3 Volume:199 Page:658-664
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Boyer V.,Elkihel M.,El Baz D.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. OR-Library, J.E. Beasley, .

2. Knapsack Problems;Kellerer,2004

3. New trends in exact algorithms for the 0–1 knapsack problem;Martello;European Journal of Operational Research,2000

4. Knapsack Problems – Algorithms and Computer Implementations;Martello,1990

5. Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0–1 knapsack problem;El Baz;Journal of Parallel and Distributed Computing,2005

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic;European Journal of Operational Research;2024-08

2. Improved binary marine predator algorithm-based digital twin-assisted edge-computing offloading method;Future Generation Computer Systems;2024-06

3. A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack;Journal of Global Optimization;2024-02-15

4. An Efficient Reduced-Memory GPU-based Dynamic Programming Strategy for Bounded Knapsack Problems;2022 Seventh International Conference on Parallel, Distributed and Grid Computing (PDGC);2022-11-25

5. Revisiting surrogate relaxation for the multidimensional knapsack problem;Operations Research Letters;2022-11