Heuristic solutions for the multiple-choice multi-dimension knapsack problem
From MaRDI portal
Recommendations
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
Cited in
(21)- Cut generation for an integrated employee timetabling and production scheduling problem
- Cut generation for an employee timetabling problem
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A heuristic algorithm for resource allocation/reallocation problem
- scientific article; zbMATH DE number 1281676 (Why is no real title available?)
- Vector bin packing with multiple-choice
- The multiple-choice multi-period knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- Heuristics for the general multiple non-linear knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
This page was built for publication: Heuristic solutions for the multiple-choice multi-dimension knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2779608)