The core concept for the Multidimensional Knapsack problem

DOI10.1007/11730095_17MaRDI QIDQ1742610zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• The multidimensional knapsack problem: structure and algorithms
• CORAL: an exact algorithm for the multidimensional knapsack problem
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core

Cited in

(20)

• An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
• Variable neighbourhood search: Methods and applications
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• The multidimensional knapsack problem: structure and algorithms
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
• CORAL: an exact algorithm for the multidimensional knapsack problem
• Variable neighbourhood search: methods and applications
• Computing the metric dimension of graphs by genetic algorithms
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• 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
• Robust efficiency measures for linear knapsack problem variants
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem

This page was built for publication: The core concept for the Multidimensional Knapsack problem

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