A minimal algorithm for the multiple-choice knapsack problem-Reference-Cited by-同舟云学术

A minimal algorithm for the multiple-choice knapsack problem

Published:1995-06 Issue:2 Volume:83 Page:394-410
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pisinger David

Publisher

Elsevier BV

Subject

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

Reference22 articles.

1. A computational study of a multiple-choice knapsack algorithm;Armstrong;ACM Transactions on Mathematical Software,1983

2. An algorithm for large zero-one Knapsack Problems;Balas;Operations Research,1980

3. Discrete variable extremum problems;Dantzig;Operations Research,1957

4. A fast algorithm for the linear multiple-choice knapsack problem;Dudzinski;Operations Research Letters,1984

5. Exact methods for the knapsack problem and its generalizations;Dudzinski;European Journal of Operational Research,1987

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

1. Natural capital approaches for the optimal design of policies for nature recovery;Philosophical Transactions of the Royal Society B: Biological Sciences;2024-04-22

2. QV4;Proceedings of the ACM Multimedia Systems Conference 2024 on ZZZ;2024-04-15

3. A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem;AIRO Springer Series;2024

4. Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications;IEEE Transactions on Cybernetics;2024

5. Cross-Border Capacity Planning in Air Traffic Management Under Uncertainty;Transportation Science;2023-07