A column generation method for the multiple-choice multi-dimensional knapsack problem
- 28 May 2008
- journal article
- Published by Springer Science and Business Media LLC in Computational Optimization and Applications
- Vol. 46 (1), 51-73
- https://doi.org/10.1007/s10589-008-9184-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Integer ProgrammingPublished by Wiley ,2020
- A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack ProblemComputational Optimization and Applications, 2005
- Heuristic algorithms for the multiple-choice multidimensional knapsack problemJournal of the Operational Research Society, 2004
- Knapsack ProblemsPublished by Springer Science and Business Media LLC ,2004
- A Column Generation Approach for Graph ColoringINFORMS Journal on Computing, 1996
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming ProblemsManagement Science, 1975
- Introduction to Electronic Data Processing Equipment: its operation and controlJournal of the Operational Research Society, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961