A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem

DOI10.1287/ijoc.2019.0909OpenAlexW3015188655MaRDI QIDQ5148190

Renata Mansini, Roberto Zanotti

Publication date: 1 February 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2019.0909

zbMATH Keywords

exact algorithmmultiple choice knapsack problemmultidimensional knapsack problem0-1 knapsack problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• A ``reduce and solve approach for the multiple-choice 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
• New convergent heuristics for 0-1 mixed integer programming
• 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
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A multidimensional knapsack model for asset-backed securitization
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem

This page was built for publication: A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem