Hard multidimensional multiple choice knapsack problems, an empirical study
From MaRDI portal
Publication:733540
DOI10.1016/J.COR.2009.04.006zbMATH Open1178.90288OpenAlexW2116220526MaRDI QIDQ733540FDOQ733540
Authors: Bing Han, Jimmy Leblet, Gwendal Simon 
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.006
Recommendations
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- scientific article; zbMATH DE number 1728442
- The multidimensional knapsack problem: structure and algorithms
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A branch-and-bound algorithm for hard multiple knapsack problems
- Some new results on multi-dimension Knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
Cites Work
- Title not available (Why is that?)
- Where are the hard knapsack problems?
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Packing and partitioning orbitopes
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Core problems in knapsack algorithms
- Exploiting orbits in symmetric ILP
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- Orbitopal Fixing
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- Title not available (Why is that?)
- MVRC Heuristic for Solving the Multi-Choice Multi-Constraint Knapsack Problem
- The knapsack problem: A survey
Cited In (16)
- Title not available (Why is that?)
- Piece selection algorithms for layered video streaming in P2P networks
- A decentralized heuristic for multiple-choice combinatorial optimization problems
- The multiple multidimensional knapsack with family-split penalties
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Title not available (Why is that?)
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- Title not available (Why is that?)
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Solving constrained optimization problems by solution-based decomposition search
- A trust region method for the solution of the surrogate dual in integer programming
- 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
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Uses Software
This page was built for publication: Hard multidimensional multiple choice knapsack problems, an empirical study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733540)
