A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
| Year of publication: |
2022
|
|---|---|
| Authors: | Parragh, Sophie N. ; Tricoire, Fabien ; Gutjahr, Walter J. |
| Published in: |
OR spectrum : quantitative approaches in management. - Berlin : Springer, ISSN 1436-6304, ZDB-ID 1467029-X. - Vol. 44.2022, 2, p. 419-459
|
| Subject: | Benders decomposition | Bi-objective optimization | Branch and bound | L-shaped method | Pareto efficiency | Stochastic optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Stochastischer Prozess | Stochastic process | Pareto-Optimum | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice |
-
Exact solution algorithms for the maximum flow problem with additional conflict constraints
Şuvak, Zeynep, (2020)
-
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
Caselli, Giulia, (2024)
-
Decomposition methods for the parallel machine scheduling problem with setups
Tran, Tony T., (2016)
- More ...
-
Bökler, Fritz, (2024)
-
A matheuristic for tri-objective binary integer linear programming
An, Duleabom, (2024)
-
Tricoire, Fabien, (2024)
- More ...