Exact Algorithms For The Setup Knapsack Problem-Reference-Cited by-同舟云学术

Exact Algorithms For The Setup Knapsack Problem

Published:1994-08 Issue:3 Volume:32 Page:124-142
ISSN:0315-5986
Container-title:INFOR: Information Systems and Operational Research
language:en
Short-container-title:INFOR: Information Systems and Operational Research

Author:

Chajakis Emmanuel D.,Guignard Monique

Publisher

Informa UK Limited

Subject

Computer Science Applications,Information Systems,Signal Processing

Link

http://www.tandfonline.com/doi/pdf/10.1080/03155986.1994.11732244

Reference5 articles.

1. L.F. Escudero, 1990. Private communication.

2. J.B. Mazzola, 1990. Private communication.

3. C. Ryu and M. Guignard. Lagrangean approximation techniques for the simple plant location problem with an aggregate capacity constraint. Working paper 91-06-06, Decision Sciences Department, Wharton, University of Pennsylvania, Philadelphia, PA 19104-6366, 1991.

4. P. Toth, 1992. Private communication.

5. M. Tzur, 1991. Private communication.

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

1. Development and implementation of an optimization model for the assignment of medical specialties in clinics: application of the Knapsack algorithm with a graphical interface in Python;South Florida Journal of Development;2024-09-09

2. The Knapsack Problem and Its Variants: Formulations and Solution Methods;The Palgrave Handbook of Operations Research;2022

3. An improvement of dynamic programming to solve knapsack problem using multi-core system;PROCEEDING OF THE 1ST INTERNATIONAL CONFERENCE ON ADVANCED RESEARCH IN PURE AND APPLIED SCIENCE (ICARPAS2021): Third Annual Conference of Al-Muthanna University/College of Science;2022