Robust optimization for empty repositioning problems
AL Erera, JC Morales… - Operations …, 2009 - pubsonline.informs.org
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
Robust Optimization for Empty Repositioning Problems
AL Erera, JC Morales, M Savelsbergh - Operations Research, 2009 - search.proquest.com
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
Robust Optimization for Empty Repositioning Problems
AL Erera, JC Morales, M Savelsbergh - Operations Research, 2009 - dl.acm.org
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
Robust Optimization for Empty Repositioning Problems
AL Erera, JC Morales, M Savelsbergh - Operations Research, 2009 - econpapers.repec.org
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
Robust Optimization for Empty Repositioning Problems.
AL Erera, JC Morales… - Operations …, 2009 - search.ebscohost.com
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
[PDF][PDF] Robust Optimization for Empty Repositioning Problems
AL Erera, JC Morales, M Savelsbergh - 2007 - scholar.archive.org
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
[引用][C] Robust Optimization for Empty Repositioning Problems
AL ERERA, JC MORALES… - Operations …, 2009 - pascal-francis.inist.fr
Robust Optimization for Empty Repositioning Problems CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Robust Optimization for Empty Repositioning Problems
AL Erera, JC Morales, M Savelsbergh - Operations Research, 2009 - JSTOR
We develop a robust optimization framework for dynamic empty repositioning problems
modeled using time-space networks. In such problems, uncertainty arises primarily from …
modeled using time-space networks. In such problems, uncertainty arises primarily from …
[PDF][PDF] Robust Optimization for Empty Repositioning Problems
AL Erera, JC Morales, M Savelsbergh - 2005 - isye.gatech.edu
This paper develops a robust optimization framework for dynamic empty repositioning
problems modeled using time-expanded networks. In such problems, uncertainty arises …
problems modeled using time-expanded networks. In such problems, uncertainty arises …
[引用][C] Robust Optimization for empty Repositioning Problems.
AL Erera, JC Morales, M Savelsbergh - Operations research, 2009 - dialnet.unirioja.es