Combinatorial algorithms for inverse network flow problems
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Jianzhong Zhang & Mao Cai, 1998. "Inverse problem of minimum cuts," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(1), pages 51-58, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem," Working papers WP 4006-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
- Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "Inverse optimization," Working papers WP 4002-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
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.- Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
- Chung, Yerim & Culus, Jean-François & Demange, Marc, 2015. "Inverse chromatic number problems in interval and permutation graphs," European Journal of Operational Research, Elsevier, vol. 243(3), pages 763-773.
- Clemens Heuberger, 2004. "Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 329-361, September.
- Ahuja, Ravindra K., 1956- & Orlin, James B., 1953-, 1998. "Inverse optimization," Working papers WP 4003-98., Massachusetts Institute of Technology (MIT), Sloan School of Management.
- M. Cai & X. Yang & Y. Li, 2000. "Inverse Problems of Submodular Functions on Digraphs," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 559-575, March.
- Zhenhong Liu & Jianzhong Zhang, 2003. "On Inverse Problems of Optimum Perfect Matching," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 215-228, September.
- Zhang, Jianzhong & Liu, Zhenhong & Ma, Zhongfan, 2000. "Some reverse location problems," European Journal of Operational Research, Elsevier, vol. 124(1), pages 77-88, July.
- Adrian Deaconu & Laura Ciupala, 2020. "Inverse Minimum Cut Problem with Lower and Upper Bounds," Mathematics, MDPI, vol. 8(9), pages 1-10, September.
- Rishabh Gupta & Qi Zhang, 2022. "Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2720-2735, September.
- Timothy C. Y. Chan & Katharina Forster & Steven Habbous & Claire Holloway & Luciano Ieraci & Yusuf Shalaby & Nasrin Yousefi, 2022. "Inverse optimization on hierarchical networks: an application to breast cancer clinical pathways," Health Care Management Science, Springer, vol. 25(4), pages 590-622, December.
- Ravindra K. Ahuja & James B. Orlin, 2001. "Inverse Optimization," Operations Research, INFORMS, vol. 49(5), pages 771-783, October.
- Timothy C. Y. Chan & Maria Eberg & Katharina Forster & Claire Holloway & Luciano Ieraci & Yusuf Shalaby & Nasrin Yousefi, 2022. "An Inverse Optimization Approach to Measuring Clinical Pathway Concordance," Management Science, INFORMS, vol. 68(3), pages 1882-1903, March.
More about this item
Keywords
HD28 .M414 no.4004-98;JEL classification:
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:mit:sloanp:2698. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.