A column generation method for the multiple-choice multi-dimensional knapsack problem
From MaRDI portal
Publication:969718
DOI10.1007/S10589-008-9184-7zbMATH Open1190.90157OpenAlexW2171590590MaRDI QIDQ969718FDOQ969718
Authors: Mhand Hifi, Nawal Cherfi 
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
Recommendations
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- An Algorithm for Large Zero-One Knapsack Problems
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- A Column Generation Approach for Graph Coloring
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
Cited In (16)
- A heuristic algorithm for resource allocation/reallocation problem
- Column basis reduction and decomposable knapsack problems
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- A column-generation approach to the multiple knapsack problem with color constraints
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- An Improved Knapsack Solver for Column Generation
- Large-Scale Scientific Computing
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
Uses Software
This page was built for publication: A column generation method for the multiple-choice multi-dimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969718)
