A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
From MaRDI portal
Publication:2506174
DOI10.1007/s10589-005-3057-0zbMath1103.90086MaRDI QIDQ2506174
Mhand Hifi, M. Michrafy, Abdelkader Sbihi
Publication date: 28 September 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-3057-0
90B40: Search theory
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Coordinated road-network search route planning by a team of UAVs, A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem, A heuristic algorithm for resource allocation/reallocation problem, Hard multidimensional multiple choice knapsack problems, an empirical study, Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights, A column generation method for the multiple-choice multi-dimensional knapsack problem, A cooperative local search-based algorithm for the multiple-scenario max-min 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 best first search exact algorithm for the multiple-choice multidimensional knapsack problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
Uses Software
Cites Work
- Minimax resource allocation problems: Optimization and parametric analysis
- A min-max resource allocation problem with substitutions
- A genetic algorithm for the multidimensional knapsack problem
- A genetic algorithm for the set covering problem
- A minimal algorithm for the multiple-choice knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
