Kernel search: a general heuristic for the multi-dimensional knapsack problem

DOI10.1016/J.COR.2010.02.002MaRDI QIDQ976023zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

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

zbMATH Keywords

heuristicsbinary variableskernel searchmulti-dimensional knapsack problem

Mathematics Subject Classification ID

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

Recommendations

• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• Kernel search: a new heuristic framework for portfolio selection
• The core concept for the Multidimensional Knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• The multidimensional knapsack problem: structure and algorithms

Cites work

• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A genetic algorithm for the multidimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A multidimensional knapsack model for asset-backed securitization
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• Core problems in knapsack algorithms
• Fast, effective heuristics for the 0-1 multi-dimensional 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
• The Theory and Computation of Knapsack Functions
• The core concept for the Multidimensional Knapsack problem

Cited in

(54)

• A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
• Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
• A kernel search heuristic for a fair facility location problem
• Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
• The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules
• Complexity indices for the multidimensional knapsack problem
• Evolution of new algorithms for the binary knapsack problem
• CORAL: an exact algorithm for the multidimensional knapsack problem
• Adaptive kernel search: a heuristic for solving mixed integer linear programs
• Revisiting surrogate relaxation for the multidimensional knapsack problem
• Adaptive memory search for multidemand multidimensional knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Fixed set search applied to the clique partitioning problem
• A heuristic approach for the integrated production-transportation problem with process flexibility
• Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
• Optimal selection of touristic packages based on user preferences during sports mega-events
• Mixed integer linear programming for feature selection in support vector machine
• A comparative analysis of two matheuristics by means of merged local optima networks
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• Two-dimensional knapsack-block packing problem
• Twenty years of linear programming based portfolio optimization
• Alternating control tree search for knapsack/covering problems
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
• The multi-visit team orienteering problem with precedence constraints
• Matheuristics: survey and synthesis
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• Kernel technology to solve discrete optimization problems
• On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution
• Decomposition based hybrid metaheuristics
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• An efficient heuristic algorithm for the alternative-fuel station location problem
• A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
• Robust efficiency measures for linear knapsack problem variants
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)
• Essential particle swarm optimization queen with tabu search for MKP resolution
• An effective hybrid approach to the two-stage capacitated facility location problem
• Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
• Order batching using an approximation for the distance travelled by pickers
• An effective matheuristic for the capacitated total quantity discount problem
• A heuristic for BILP problems: the single source capacitated facility location problem
• Kernel search: a new heuristic framework for portfolio selection
• Kernel search: an application to the index tracking problem
• A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model
• Index tracking with fixed and variable transaction costs
• A kernel search heuristic for the multivehicle inventory routing problem

Describes a project that uses

Uses Software

• MIPLIB
• Knapsack

This page was built for publication: Kernel search: a general heuristic for the multi-dimensional knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976023)