An exact algorithm for the multiple-choice multidimensional knapsack problem.
Year of publication: |
2004-03
|
---|---|
Authors: | Hifi, Mhand ; Sadfi, Slim ; Sbihi, Abdelkader |
Institutions: | Maison des Sciences Économiques, Université Paris 1 (Panthéon-Sorbonne) |
Subject: | Combinatorial optimization | branch and bound | sequential algorithm | Knapsack problem |
Series: | Cahiers de la Maison des Sciences Economiques. - ISSN 1624-0340. |
---|---|
Type of publication: | Book / Working Paper |
Notes: | 16 pages |
Classification: | C44 - Statistical Decision Theory; Operations Research ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C63 - Computational Techniques |
Source: |
-
Sensitivity analysis of the knapsack sharing problem : perturbation of the weight.
Belgacem, Tarik, (2007)
-
Sensitivity analysis of the knapsack sharing problem : perturbation of the profit.
Belgacem, Tarik, (2007)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
Strip generation algorithms for constrained two-dimensional two-staged cutting problems : part II.
Hifi, Mhand, (2004)
-
Hifi, Mhand, (2008)
-
Hifi, Mhand, (2008)
- More ...