An exact decomposition algorithm for the generalized knapsack sharing problem-Reference-Cited by-同舟云学术

An exact decomposition algorithm for the generalized knapsack sharing problem

Published:2016-08 Issue:3 Volume:252 Page:761-774
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Dahmani Isma,Hifi Mhand,Wu Lei^ORCID

Publisher

Elsevier BV

Subject

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

Reference23 articles.

1. A dynamic programming method with lists for the knapsack sharing problem;Boyer;Computers & Industrial Engineering,2011

2. The knapsack sharing;Brown;Operations Research,1979

3. Decomposition techniques in mathematical programming - Engineering and science applications;Conejo,2006

4. An exact algorithm for the knapsack sharing problem with common items;Fujimoto;European Journal of Operational Research,2006

5. A hybrid heuristic for the 0–1 knapsack sharing problem;Haddar;Expert Systems with Applications,2015

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

1. Heuristic and exact reduction procedures to solve the discounted 0–1 knapsack problem;European Journal of Operational Research;2023-02

2. Knapsack problems — An overview of recent advances. Part I: Single knapsack problems;Computers & Operations Research;2022-07

3. An exact algorithm for large knapsack sharing problems;INFOR: Information Systems and Operational Research;2022-03-21

4. An iterative algorithm for the Max-Min knapsack problem with multiple scenarios;Operational Research;2019-03-09

5. Operations research applications of dichotomous search;European Journal of Operational Research;2018-03