Kernel search: a general heuristic for the multi-dimensional knapsack problem
From MaRDI portal
Publication:976023
DOI10.1016/J.COR.2010.02.002zbMATH Open1188.90207OpenAlexW2080336407MaRDI QIDQ976023FDOQ976023
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
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- An Algorithm for Large Zero-One Knapsack Problems
- 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
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Core problems in knapsack algorithms
- The Theory and Computation of Knapsack Functions
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- The core concept for the Multidimensional Knapsack problem
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A multidimensional knapsack model for asset-backed securitization
- Title not available (Why is that?)
Cited In (53)
- 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
- Adaptive memory search for multidemand multidimensional knapsack problems
- Two-dimensional knapsack-block packing problem
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- Evolution of new algorithms for the binary knapsack problem
- An efficient heuristic algorithm for the alternative-fuel station location problem
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
- Mixed integer linear programming for feature selection in support vector machine
- 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 two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Optimal selection of touristic packages based on user preferences during sports mega-events
- A comparative analysis of two matheuristics by means of merged local optima networks
- 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
- On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution
- Decomposition based hybrid metaheuristics
- An effective matheuristic for the capacitated total quantity discount problem
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- The multi-visit team orienteering problem with precedence constraints
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- Title not available (Why is that?)
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Fixed set search applied to the clique partitioning problem
- Robust efficiency measures for linear knapsack problem variants
- Complexity indices for the multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- Index tracking with fixed and variable transaction costs
- A kernel search heuristic for a fair facility location problem
- The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- A kernel search heuristic for the multivehicle inventory routing problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Alternating control tree search for knapsack/covering problems
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms
- A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Kernel technology to solve discrete optimization problems
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
- An effective hybrid approach to the two-stage capacitated facility location problem
- Twenty years of linear programming based portfolio optimization
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- Order batching using an approximation for the distance travelled by pickers
- 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
Uses Software
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)
