A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
DOI10.1016/J.EJOR.2021.05.007zbMATH Open1487.90560OpenAlexW3162315644MaRDI QIDQ2242191FDOQ2242191
Authors: Leonardo Lamanna, Renata Mansini, Roberto Zanotti 
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.05.007
Recommendations
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- Statistical comparisons of classifiers over multiple data sets
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- First-level tabu search approach for solving the multiple-choice multidimensional 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
- Kernel search: a new heuristic framework for portfolio selection
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- The Theory and Computation of Knapsack Functions
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A multidimensional knapsack model for asset-backed securitization
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- Guided local search and its application to the traveling salesman problem
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
Cited In (10)
- Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Title not available (Why is that?)
- Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
This page was built for publication: A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242191)
