An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem

DOI10.1016/J.EJOR.2016.11.042zbMath1402.90146OpenAlexW2559457754MaRDI QIDQ1753394

Xin Yao, Guanzhou Lu, Chao Gao, Jinlong Li

Publication date: 29 May 2018

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

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/38031823/Gao_et_al_An_iterative_pseudo_gap_EOR_2016.pdf

zbMATH Keywords

heuristicsinteger programmingmultidimensional multiple-choice knapsackreduced cost constraint

Mathematics Subject Classification ID

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

Related Items (5)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
• Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A column generation method for the multiple-choice multi-dimensional knapsack problem
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
• Towards the real time solution of strike force asset allocation problems
• 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
• Heuristics for determining the number of warehouses for storing non-compatible products
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• A Shrinking Boundary Algorithm for Discrete System Models
• Budgeting with bounded multiple-choice constraints.

This page was built for publication: An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem