Kernel search: a general heuristic for the multi-dimensional knapsack problem
From MaRDI portal
Publication:976023
DOI10.1016/j.cor.2010.02.002zbMath1188.90207OpenAlexW2080336407MaRDI QIDQ976023
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.02.002
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (43)
A heuristic for BILP problems: the single source capacitated facility location problem ⋮ Decomposition based hybrid metaheuristics ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Order batching using an approximation for the distance travelled by pickers ⋮ A kernel search heuristic for a fair facility location problem ⋮ The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms ⋮ Mixed integer linear programming for feature selection in support vector machine ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Matheuristics: survey and synthesis ⋮ A kernel search heuristic for the multivehicle inventory routing problem ⋮ A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators ⋮ A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model ⋮ The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules ⋮ Fixed set search applied to the clique partitioning problem ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic ⋮ Kernel search: an application to the index tracking problem ⋮ Index tracking with fixed and variable transaction costs ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ Essential particle swarm optimization queen with tabu search for MKP resolution ⋮ Two-dimensional knapsack-block packing problem ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ An efficient heuristic algorithm for the alternative-fuel station location problem ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem ⋮ Evolution of new algorithms for the binary knapsack problem ⋮ A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over ⋮ A comparative analysis of two matheuristics by means of merged local optima networks ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ The multi-visit team orienteering problem with precedence constraints ⋮ Twenty years of linear programming based portfolio optimization ⋮ Complexity indices for the multidimensional knapsack problem ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem
Uses Software
Cites Work
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- The core concept for the Multidimensional Knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Core Problems in Knapsack Algorithms
- An Algorithm for Large Zero-One Knapsack Problems
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A multidimensional knapsack model for asset-backed securitization
- The Theory and Computation of Knapsack Functions
- Unnamed Item
- Unnamed Item
This page was built for publication: Kernel search: a general heuristic for the multi-dimensional knapsack problem
