A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem

DOI10.1016/J.EJOR.2014.05.025zbMath1339.90237OpenAlexW1994778471MaRDI QIDQ297243

Jin-Kao Hao, Yuning Chen

Publication date: 24 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.025

zbMATH Keywords

knapsacklinear relaxationhybridizationfixing heuristics

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ A threshold search based memetic algorithm for the disjunctively constrained knapsack problem ⋮ An improved binary search algorithm for the Multiple-Choice Knapsack Problem ⋮ Responsive strategic oscillation for solving the disjunctively constrained knapsack problem ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem ⋮ An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
• New convergent heuristics for 0-1 mixed integer programming
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Heuristics for determining the number of warehouses for storing non-compatible products
• Budgeting with bounded multiple-choice constraints.

This page was built for publication: A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem