An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core

DOI10.1007/978-3-540-89985-3_34zbMath1160.90643OpenAlexW59684277MaRDI QIDQ3628453

Taha Ghasemi, Mohammadreza Razzazi

Publication date: 20 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89985-3_34

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
• An Algorithm for Large Zero-One Knapsack Problems
• Surrogate Constraint Duality in Mathematical Programming
• The Multiple-Choice Knapsack Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem

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