Approximate and exact algorithms for the fixed-charge knapsack problem-Reference-Cited by-同舟云学术

Approximate and exact algorithms for the fixed-charge knapsack problem

Published:2006-04 Issue:2 Volume:170 Page:363-375
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Akinc Umit

Publisher

Elsevier BV

Subject

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

Reference12 articles.

1. An algorithm for the knapsack problem;Akinc;AIIE Transactions,1983

2. Exact algorithms for the setup knapsack problem;Chajakis;INFOR,1994

3. Approximation algorithms for bin packing––an updated survey in Auselio;Coffmann,1984

4. A branch and bound algorithm for solving the multiple choice knapsack problem;Dyer;Journal of Computational and Applied Mathematics,1984

5. Production and Inventory Management;Fogarty,1991

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

1. A biased random-key genetic algorithm for the knapsack problem with forfeit sets;Soft Computing;2024-07-31

2. Fixed Set Search Matheuristic Applied to the min-Knapsack Problem with Compactness Constraints and Penalty Values;Lecture Notes in Computer Science;2024

3. The Knapsack Problem with forfeit sets;Computers & Operations Research;2023-03

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

5. Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup;Lecture Notes in Networks and Systems;2021-07-13