Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 40, 1997 - Issue 2
Submit an article Journal homepage
153
Views
60
CrossRef citations to date
0
Altmetric
Original Articles

Inverse maximum flow and minimum cut problems

C. Yang Department of Mathematics, City University of Hong Kong, Hong Kong
,
J. Zhang Department of Mathematics, City University of Hong Kong, Hong Kong
&
Z. Ma Institute of System Science, Academic Sinica, Beijing, China
Pages 147-170 | Published online: 20 Mar 2007

Citations (60)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Zahra Ghatrani & Archis Ghate. (2023) Inverse Markov decision processes with unknown transition probabilities. IISE Transactions 55:6, pages 588-601.
Read now
Jianzhong Zhang, Shaoji Xu & Zhongfan Ma. (1997) An algorithm for inverse minimum spanning tree problem. Optimization Methods and Software 8:1, pages 69-84.
Read now

Articles from other publishers (58)

Elham Ramzani Ghalebala, Massoud Aman & Nasim Nasrabadi. (2023) A Weighted Inverse Minimum s − t Cut Problem with Value Constraint Under the Bottleneck-Type Hamming Distance. Asia-Pacific Journal of Operational Research 41:01.
Crossref
Abdul Razzaq Abdul Ghaffar, Anas Melethil & Ahmad Yusuf Adhami. (2023) A bibliometric analysis of inverse optimization. Journal of King Saud University - Science 35:7, pages 102825.
Crossref
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 25:4, pages 590-622.
Crossref
Rishabh Gupta & Qi Zhang. (2022) Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization. INFORMS Journal on Computing 34:5, pages 2720-2735.
Crossref
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 68:3, pages 1882-1903.
Crossref
Michael S. Hughes & Brian J. Lunday. (2022) The Weapon Target Assignment Problem: Rational Inference of Adversary Target Utility Valuations from Observed Solutions. Omega 107, pages 102562.
Crossref
Kien Trung Nguyen & Nguyen Thanh Hung. (2021) The minmax regret inverse maximum weight problem. Applied Mathematics and Computation 407, pages 126328.
Crossref
Long-Cheng Liu, Han Gao & Chao Li. (2019) Inverse Maximum Flow Problem Under the Combination of the Weighted l$$_2$$ Norm and the Weighted Hamming Distance. Journal of the Operations Research Society of China 9:2, pages 465-474.
Crossref
Archis Ghate. (2021) Inverse conic linear programs in Banach spaces. Optimization Letters 15:2, pages 289-310.
Crossref
Archis Ghate. (2020) Imputing radiobiological parameters of the linear-quadratic dose-response model from a radiotherapy fractionation plan. Physics in Medicine & Biology 65:22, pages 225009.
Crossref
Adrian Deaconu & Laura Ciupala. (2020) Inverse Minimum Cut Problem with Lower and Upper Bounds. Mathematics 8:9, pages 1494.
Crossref
Javad Tayyebi & Adrian Deaconu. (2019) Inverse Generalized Maximum Flow Problems. Mathematics 7:10, pages 899.
Crossref
Javad Tayyebi, Abumoslem Mohammadi & Seyyed Mohammad Reza Kazemi. (2018) Reverse maximum flow problem under the weighted Chebyshev distance. RAIRO - Operations Research 52:4-5, pages 1107-1121.
Crossref
Longcheng Liu, Wenhao Zheng & Chao Li. (2017) Inverse minimum flow problem under the weighted sum-type Hamming distance. Discrete Applied Mathematics 229, pages 101-112.
Crossref
Petrie Wong, Cliz Sun, Eric Lo, Man Lung Yiu, Xiaowei Wu, Zhichao Zhao, T.-H. Hubert Chan & Ben Kao. (2017) Finding k most influential edges on flow graphs. Information Systems 65, pages 93-105.
Crossref
Longcheng Liu, Yu’an Chen, Wenhao Zheng & Deqing Wang. 2017. Testbeds and Research Infrastructures for the Development of Networks and Communities. Testbeds and Research Infrastructures for the Development of Networks and Communities 158 167 .
Yerim Chung, Jean-Fran?ois Culus & Marc Demange. (2015) Inverse chromatic number problems in interval and permutation graphs. European Journal of Operational Research 243:3, pages 763-773.
Crossref
Yerim Chung & Myoung-Ju Park. (2015) Notes on inverse bin-packing problems. Information Processing Letters 115:1, pages 60-68.
Crossref
António Leitão, Adriano Vinhas, Penousal Machado & Francisco Câmara Pereira. (2014) A Genetic Algorithms Approach for Inverse Shortest Path Length Problems. International Journal of Natural Computing Research 4:4, pages 36-54.
Crossref
Marc Demange & Jérôme Monnot. 2014. Paradigms of Combinatorial Optimization. Paradigms of Combinatorial Optimization 547 586 .
. 2014. Paradigms of Combinatorial Optimization. Paradigms of Combinatorial Optimization 707 765 .
Huaiqin Wu, Kewang Wang, Qiangqiang Guo, Guohua Xu & Ning Li. (2012) Design of a kind of nonlinear neural networks for solving the inverse optimal value problem with convex constraints. International Journal of Machine Learning and Cybernetics 5:1, pages 85-92.
Crossref
Hongtruong Pham & Xiwen Lu. (2013) The inverse parallel machine scheduling problem with minimum total completion time. Journal of Industrial and Management Optimization 10:2, pages 613-620.
Crossref
Cheng Xu & Xiaoming Xu. (2013) Some inverse optimization problems on network. Journal of Systems Science and Complexity 26:3, pages 350-364.
Crossref
ADRIAN DEACONU & ELEONOR CIUREA. (2013) Inverse feasibility problems of the inverse maximum flow problems. Sadhana.
Crossref
Marc Demange & Jérôme Monnot. 2013. Paradigms of Combinatorial Optimization. Paradigms of Combinatorial Optimization 547 586 .
Longcheng Liu. 2013. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management 221 230 .
Huaiqin Wu, Kewang Wang, Ning Li, Chongyang Wu, Qiangqiang Guo & Guohua Xu. (2012) Applications of the General Nonlinear Neural Networks in Solving the Inverse Optimal Value Problem with Linear Constraints. Information Technology Journal 11:6, pages 713-718.
Crossref
Longcheng Liu, Yong Chen, Biao Wu & Enyu Yao. 2012. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management 26 35 .
Mehri Bagherian. (2010) The inverse maximum dynamic flow problem. Science China Mathematics 53:10, pages 2709-2717.
Crossref
Liwei Dong, Weijing Yin & Hong Wang. (2010) General Inverse Maximum Flow Problem under Sum-Type Weighted Hamming Distance. General Inverse Maximum Flow Problem under Sum-Type Weighted Hamming Distance.
Jianzhong Zhang & Chengxian Xu. (2010) Inverse optimization for linearly constrained convex separable programming problems. European Journal of Operational Research 200:3, pages 671-679.
Crossref
Çiğdem Güler & Horst W. Hamacher. (2008) Capacity inverse minimum cost flow problem. Journal of Combinatorial Optimization 19:1, pages 43-59.
Crossref
Adrian Deaconu. (2008) The inverse maximum flow problem considering l ∞ norm . RAIRO - Operations Research 42:3, pages 401-414.
Crossref
Adrian Deaconu. (2008) The inverse maximum flow problem with lower and upper bounds for the flow. Yugoslav Journal of Operations Research 18:1, pages 13-22.
Crossref
Xiucui Guan & Jianzhong Zhang. (2007) Inverse constrained bottleneck problems under weighted norm. Computers & Operations Research 34:11, pages 3243-3254.
Crossref
LONGCHENG LIU & ENYU YAO. (2011) A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE. Asia-Pacific Journal of Operational Research 24:05, pages 725-736.
Crossref
Gholam R. Amin & Ali Emrouznejad. (2007) Inverse forecasting: A new approach for predictive modeling. Computers & Industrial Engineering 53:3, pages 491-498.
Crossref
Eleonor Ciurea & Adrian Deaconu. (2007) Inverse minimum flow problem. Journal of Applied Mathematics and Computing 23:1-2, pages 193-203.
Crossref
Yu-quan Cui, Li-jie Ma & Jianmin Wang. (2006) A New Method of Estimating Inputs. A New Method of Estimating Inputs.
Longcheng Liu & Jianzhong Zhang. (2006) Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization 12:4, pages 395-408.
Crossref
Abdollah Hadi-Vencheh & Ali Asghar Foroughi. (2006) A generalized DEA model for inputs/outputs estimation. Mathematical and Computer Modelling 43:5-6, pages 447-457.
Crossref
Xiucui Guan & Jianzhong Zhang. 2005. Computational Science and Its Applications – ICCSA 2005. Computational Science and Its Applications – ICCSA 2005 161 171 .
G.R Jahanshahloo, F Hosseinzadeh Lotfi, N Shoja, G Tohidi & S Razavyan. (2004) Input estimation and identification of extra inputs in inverse DEA models. Applied Mathematics and Computation 156:2, pages 427-437.
Crossref
Andr?s Farag??ron Szentesi & Bal?zs Szviatovszki. (2003) Inverse optimization in high-speed networks. Discrete Applied Mathematics 129:1, pages 83-98.
Crossref
Ravindra K. Ahuja & James B. Orlin. (2002) Combinatorial algorithms for inverse network flow problems. Networks 40:4, pages 181-187.
Crossref
Ravindra K. Ahuja & James B. Orlin. (2001) Inverse Optimization. Operations Research 49:5, pages 771-783.
Crossref
Yang Xiaoguang. (2001) Robust partial inverse network flow problems. Applied Mathematics-A Journal of Chinese Universities 16:2, pages 185-194.
Crossref
Xiaoguang Yang. (2002) Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem. RAIRO - Operations Research 35:1, pages 117-126.
Crossref
Jianzhong Zhang, Zhenhong Liu & Zhongfan Ma. (2000) Some reverse location problems. European Journal of Operational Research 124:1, pages 77-88.
Crossref
M. Cai, X. Yang & Y. Li. (2000) Inverse Problems of Submodular Functions on Digraphs. Journal of Optimization Theory and Applications 104:3, pages 559-575.
Crossref
Quanling Wei, Jianzhong Zhang & Xiangsun Zhang. (2000) An inverse DEA model for inputs/outputs estimate. European Journal of Operational Research 121:1, pages 151-163.
Crossref
Ravindra K. Ahuja & James B. Orlin. (2000) A Faster Algorithm for the Inverse Spanning Tree Problem. Journal of Algorithms 34:1, pages 177-193.
Crossref
Jianzhong Zhang & Zhenhong Liu. (1999) A further study on inverse linear programming problems. Journal of Computational and Applied Mathematics 106:2, pages 345-359.
Crossref
Jianzhong Zhang, Zhenhong Liu & Zhongfan Ma. (2009) The inverse fractional matching problem. The Journal of the Australian Mathematical Society. Series B. Applied Mathematics 40:4, pages 484-496.
Crossref
Alok Aggarwal & C. Pandu RanganJianzhong Zhang, Xiaoguang Yang & Mao-cheng Cai. 1999. Algorithms and Computation. Algorithms and Computation 279 294 .
Yang Xiaoguang. (1998) Note on inverse problem with l ∞ objective function. Applied Mathematics-A Journal of Chinese Universities 13:3, pages 341-346.
Crossref
Jianzhong Zhang & Mao -Cheng Cai. (1998) Inverse problem of minimum cuts. Mathematical Methods of Operations Research 47:1, pages 51-58.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.