An exact algorithm for the reliability redundancy allocation problem
Year of publication: |
2015
|
---|---|
Authors: | Caserta, Marco ; Voß, Stefan |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 1 (1.7.), p. 110-116
|
Subject: | Redundancy allocation problem | Multiple choice knapsack problem | Branch and cut | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Allokation | Allocation | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming |
-
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio, (2015)
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
- More ...
-
An exact algorithm for the reliability redundancy allocation problem
Caserta, Marco, (2015)
-
A mathematical formulation and complexity considerations for the blocks relocation problem
Caserta, Marco, (2012)
-
A MIP-based framework and its application on a lot sizing problem with setup carryover
Caserta, Marco, (2013)
- More ...