Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem

DOI10.1504/IJOR.2009.024531zbMath1169.90484OpenAlexW3023784225MaRDI QIDQ840573

Publication date: 13 September 2009

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

Full work available at URL: https://doi.org/10.1504/ijor.2009.024531

zbMATH Keywords

heuristics column generation branch-and-bound knapsack problem hybrid algorithms optimisation local branching multiple choice

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem

Uses Software

Knapsack

This page was built for publication: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem