Optimal expansion of capacitated transshipment networks
Author
Abstract
Suggested Citation
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
- D. R. Fulkerson, 1959. "Increasing the Capacity of a Network: The Parametric Budget Problem," Management Science, INFORMS, vol. 5(4), pages 472-483, July.
- De Wolf, D. & Janssens De Bisthoven, O. & Smeers, Y., 1991. "The simplex algorithm extended to piecewise linearly constrained problems I: the method and an implementation," LIDAM Discussion Papers CORE 1991019, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Flippo, Olaf E. & Kolen, Antoon W. J. & Koster, Arie M. C. A. & van de Leensel, Robert L. M. J., 2000. "A dynamic programming algorithm for the local access telecommunication network expansion problem," European Journal of Operational Research, Elsevier, vol. 127(1), pages 189-202, November.
- Majid Taghavi & Kai Huang, 2020. "A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints," Annals of Operations Research, Springer, vol. 284(2), pages 605-621, January.
- Flippo Olaf E. & Kolen Antoon W.J. & Koster Arie M.C.A. & Leensel Robert L.M.J. van de, 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 015, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Majid Taghavi & Kai Huang, 2016. "A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 600-614, December.
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.- Ahuja, Ravindra K., 1956- & Kanpur, I. I. T. & Orlin, James B., 1953-, 1993. "A capacity scaling algorithm for the constrained maximum flow problem," Working papers 3587-93., Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Burkard, Rainer E. & Lin, Yixun & Zhang, Jianzhong, 2004. "Weight reduction problems with certain bottleneck objectives," European Journal of Operational Research, Elsevier, vol. 153(1), pages 191-199, February.
- Andre, Jean & Bonnans, Frédéric & Cornibert, Laurent, 2009. "Optimization of capacity expansion planning for gas transportation networks," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1019-1027, September.
- Majid Taghavi & Kai Huang, 2016. "A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 600-614, December.
- ÇalIskan, Cenk, 2011. "A specialized network simplex algorithm for the constrained maximum flow problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 137-147, April.
- Conrado Borraz-Sánchez & Russell Bent & Scott Backhaus & Hassan Hijazi & Pascal Van Hentenryck, 2016. "Convex Relaxations for Gas Expansion Planning," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 645-656, November.
- Dangalchev, Chavdar A., 2000. "Optimization of the transportation expense of a firm with contractual supplies," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 203-217, April.
- Majid Taghavi & Kai Huang, 2020. "A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints," Annals of Operations Research, Springer, vol. 284(2), pages 605-621, January.
Corrections
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:eee:ejores:v:89:y:1996:i:1:p:176-184. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.