The core concept for the Multidimensional Knapsack problem

DOI10.1007/11730095_17zbMath1401.90198OpenAlexW2104515359WikidataQ61638361 ScholiaQ61638361MaRDI QIDQ1742610

Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy

Publication date: 12 April 2018

Full work available at URL: https://doi.org/10.1007/11730095_17

Mathematics Subject Classification ID

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

Related Items

Computing the metric dimension of graphs by genetic algorithms ⋮ Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Bringing order into the neighborhoods: Relaxation guided variable neighborhood search ⋮ Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ Variable neighbourhood search: methods and applications ⋮ Kernel search: a general heuristic for the multi-dimensional knapsack problem ⋮ An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem ⋮ Variable neighbourhood search: Methods and applications ⋮ Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core