A column generation method for the multiple-choice multi-dimensional knapsack problem
From MaRDI portal
Publication:969718
DOI10.1007/s10589-008-9184-7zbMath1190.90157OpenAlexW2171590590MaRDI QIDQ969718
Publication date: 7 May 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9184-7
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem ⋮ Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem ⋮ An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ Hard multidimensional multiple choice knapsack problems, an empirical study
Uses Software
Cites Work
- Unnamed Item
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- A Linear Programming Approach to the Cutting-Stock Problem
- An Algorithm for Large Zero-One Knapsack Problems
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A Column Generation Approach for Graph Coloring
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
