On the optimum capacity of capacity expansion problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s00186-007-0147-z
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
- Zhang, Jianzhong & Liu, Zhenhong & Ma, Zhongfan, 2000. "Some reverse location problems," European Journal of Operational Research, Elsevier, vol. 124(1), pages 77-88, July.
- James B. Orlin, 1993. "A Faster Strongly Polynomial Minimum Cost Flow Algorithm," Operations Research, INFORMS, vol. 41(2), pages 338-350, April.
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.- Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.
- Wang, Gang, 2024. "Order assignment and two-stage integrated scheduling in fruit and vegetable supply chains," Omega, Elsevier, vol. 124(C).
- Jianzhong Zhang & Zhenhong Liu, 2002. "A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 207-227, June.
- Yi Zhang & Liwei Zhang & Yue Wu, 2014. "The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 45-79, April.
- Shoshana Anily, 1996. "The vehicle‐routing problem with delivery and back‐haul options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(3), pages 415-434, April.
- László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
- Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
- László A. Végh, 2014. "Concave Generalized Flows with Applications to Market Equilibria," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 573-596, May.
- Ravindra K. Ahuja & Dorit S. Hochbaum, 2008. "TECHNICAL NOTE---Solving Linear Cost Dynamic Lot-Sizing Problems in O ( n log n ) Time," Operations Research, INFORMS, vol. 56(1), pages 255-261, February.
- Sharma, Anuj & Verma, Vanita & Kaur, Prabhjot & Dahiya, Kalpana, 2015. "An iterative algorithm for two level hierarchical time minimization transportation problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 700-707.
- Elisabeth Gassner, 2008. "The inverse 1-maxian problem with edge length modification," Journal of Combinatorial Optimization, Springer, vol. 16(1), pages 50-67, July.
- Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
- I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
- 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.
- Adrian Marius Deaconu & Luciana Majercsik, 2021. "Flow Increment through Network Expansion," Mathematics, MDPI, vol. 9(18), pages 1-9, September.
- Ahmed Redha Mahlous, 2017. "SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach," Future Internet, MDPI, vol. 9(4), pages 1-18, December.
- Mehdi Ghiyasvand, 2019. "An $$O(n(m+n\log n)\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 957-969, April.
- Ding, Honglin & Li, Jianping & Lih, Ko-Wei, 2014. "Approximation algorithms for solving the constrained arc routing problem in mixed graphs," European Journal of Operational Research, Elsevier, vol. 239(1), pages 80-88.
- Elisa Letizia & Paolo Barucca & Fabrizio Lillo, 2018. "Resolution of ranking hierarchies in directed networks," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-25, February.
- Niu, Yi-Feng & Song, Yi-Fan & Xu, Xiu-Zhen & Zhao, Xia, 2022. "Efficient reliability computation of a multi-state flow network with cost constraint," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
More about this item
Keywords
Networks and graphs; Maximum capacity; Bottleneck; Polynomial algorithm;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:mathme:v:66:y:2007:i:2:p:225-233. 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.