A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
From MaRDI portal
Publication:2242191
DOI10.1016/j.ejor.2021.05.007zbMath1487.90560OpenAlexW3162315644MaRDI QIDQ2242191
Renata Mansini, Leonardo Lamanna, 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
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners ⋮ Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
Cites Work
- Unnamed Item
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Kernel search: a new heuristic framework for portfolio selection
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Guided local search and its application to the traveling salesman problem
- First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- 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 Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- The Theory and Computation of Knapsack Functions
This page was built for publication: A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
