Robust minimum cost flow problem under consistent flow constraints
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-021-04426-0
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ulrich Pferschy & Joachim Schauer, 2013. "The maximum flow problem with disjunctive constraints," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 109-119, July.
- Ravindra K. Ahuja & James B. Orlin & Giovanni M. Sechi & Paola Zuddas, 1999. "Algorithms for the Simple Equal Flow Problem," Management Science, INFORMS, vol. 45(10), pages 1440-1455, October.
- David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
- Sara Mattia, 2013. "The robust network loading problem with dynamic routing," Computational Optimization and Applications, Springer, vol. 54(3), pages 619-643, April.
- Calvete, Herminia I., 2003. "Network simplex algorithm for the general equal flow problem," European Journal of Operational Research, Elsevier, vol. 150(3), pages 585-600, November.
- H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
- Ayşegül Altın & Hande Yaman & Mustafa Ç. Pınar, 2011. "The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 75-89, February.
- Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
- Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
- Antonio Manca & Giovanni Sechi & Paola Zuddas, 2010. "Water Supply Network Optimisation Using Equal Flow Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(13), pages 3665-3678, October.
- Ali, Agha Iqbal & Kennington, Jeff & Shetty, Bala, 1988. "The equal flow problem," European Journal of Operational Research, Elsevier, vol. 36(1), pages 107-115, July.
- Carraresi, P. & Gallo, G., 1984. "Network models for vehicle and crew scheduling," European Journal of Operational Research, Elsevier, vol. 16(2), pages 139-151, May.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Dimitris Bertsimas & Ebrahim Nasrabadi & Sebastian Stiller, 2013. "Robust and Adaptive Network Flows," Operations Research, INFORMS, vol. 61(5), pages 1218-1242, October.
- Sara Mattia & Michael Poss, 2018. "A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation," Computational Optimization and Applications, Springer, vol. 69(3), pages 753-800, April.
- David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
- Hassan Hijazi & Pierre Bonami & Adam Ouorou, 2013. "Robust delay-constrained routing in telecommunications," Annals of Operations Research, Springer, vol. 206(1), pages 163-181, July.
- Siqian Shen & Mingdi You & Yintai Ma, 2017. "Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 154-173, March.
- Artur Alves Pessoa & Michael Poss, 2015. "Robust Network Design with Uncertain Outsourcing Cost," INFORMS Journal on Computing, INFORMS, vol. 27(3), pages 507-524, August.
- Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
- Tao Yao & Supreet Mandala & Byung Chung, 2009. "Evacuation Transportation Planning Under Uncertainty: A Robust Optimization Approach," Networks and Spatial Economics, Springer, vol. 9(2), pages 171-189, June.
- Haolin Ruan & Zhi Chen & Chin Pang Ho, 2023. "Adjustable Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1002-1023, September.
- Yang Wang & Yumeng Zhang & Mengyu Bi & Jianhui Lai & Yanyan Chen, 2022. "A Robust Optimization Method for Location Selection of Parcel Lockers under Uncertain Demands," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
- Alan L. Erera & Juan C. Morales & Martin Savelsbergh, 2009. "Robust Optimization for Empty Repositioning Problems," Operations Research, INFORMS, vol. 57(2), pages 468-483, April.
- Dimitris Bertsimas & Frans J. C. T. de Ruiter, 2016. "Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 500-511, August.
- Ahuja, Ravindra K., 1956-, 1997. "Algorithms for the simple equal flow problem," Working papers WP 3960-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Haiyan Lu & Enyu Yao & Liqun Qi, 2006. "Some further results on minimum distribution cost flow problems," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 351-371, June.
- Kaul, Hemanshu & Rumpf, Adam, 2022. "A linear input dependence model for interdependent networks," European Journal of Operational Research, Elsevier, vol. 302(2), pages 781-797.
- Jordi Castro, 2007. "A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 520-533, November.
- Billionnet, Alain & Costa, Marie-Christine & Poirion, Pierre-Louis, 2016. "Robust optimal sizing of a hybrid energy stand-alone system," European Journal of Operational Research, Elsevier, vol. 254(2), pages 565-575.
- Shahparvari, Shahrooz & Abbasi, Babak, 2017. "Robust stochastic vehicle routing and scheduling for bushfire emergency evacuation: An Australian case study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 104(C), pages 32-49.
- Jia Shu & Miao Song, 2014. "Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 135-149, February.
- Agostinho Agra & Marielle Christiansen & Lars Magnus Hvattum & Filipe Rodrigues, 2018. "Robust Optimization for a Maritime Inventory Routing Problem," Transportation Science, INFORMS, vol. 52(3), pages 509-525, June.
More about this item
Keywords
Minimum cost flow problem; Equal flow problem; Robust flows; Series-parallel digraphs; Dynamic programming;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:312:y:2022:i:2:d:10.1007_s10479-021-04426-0. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.