A heuristic algorith for solving large location-inventory problems with demand uncertainty
Year of publication: |
1 June 2017
|
---|---|
Authors: | Schuster Puga, Matías ; Tancrez, Jean-Sébastien |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 259.2017, 2 (1.6.), p. 413-423
|
Subject: | Location | Supply chain network design | Location-inventory model | Risk pooling | Conic quadratic mixed-integer program | Lieferkette | Supply chain | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Ganzzahlige Optimierung | Integer programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Nachfrage | Demand |
-
Tapia-Ubeda, Francisco J., (2018)
-
Minmax regret maximal covering location problems with edge demands
Baldomero-Naranjo, Marta, (2021)
-
Multi-product capacitated facility location problem with general production and building costs
Montoya, Alejandro, (2016)
- More ...
-
A tight bound on the throughputof queueing networks with blocking
Tancrez, Jean-Sébastien, (2008)
-
Aligning supply chain portfolios with product portfolios
Langenberg, Kerstin U., (2012)
-
Probability masses fitting in the analysis of manufacturing flow lines
TANCREZ, Jean-Sébastien,
- More ...