A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem

DOI10.1016/J.EJOR.2021.05.007MaRDI QIDQ2242191zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

metaheuristicsmatheuristickernel searchmultidimensional multiple-choice knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Mixed integer programming (90C11)

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

Cites work

• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• A multidimensional knapsack model for asset-backed securitization
• A reactive local search-based algorithm for the multiple-choice 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
• CORAL: an exact algorithm for the multidimensional knapsack problem
• First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
• Guided local search and its application to the traveling salesman problem
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Kernel search: a new heuristic framework for portfolio selection
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• Statistical comparisons of classifiers over multiple data sets
• The Theory and Computation of Knapsack Functions

Cited in

(10)

• Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
• scientific article; zbMATH DE number 6129400 (Why is no real title available?)
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• scientific article; zbMATH DE number 7112414 (Why is no real title available?)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)

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)