Some reverse location problems
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
- 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.
- Cai Mao-Cheng & Yanjun Li, 1997. "Inverse Matroid Intersection Problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(2), pages 235-243, June.
- Jianzhong Zhang & Zhongfan Ma, 1999. "Solution Structure of Some Inverse Combinatorial Optimization Problems," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 127-139, July.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- Franco Rubio-López & Obidio Rubio & Rolando Urtecho Vidaurre, 2023. "The Inverse Weber Problem on the Plane and the Sphere," Mathematics, MDPI, vol. 11(24), pages 1-23, December.
- Jianzhong Zhang & Liwei Zhang & Xiantao Xiao, 2010. "A Perturbation approach for an inverse quadratic programming problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 379-404, December.
- 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.
- Lindong Liu & Xiangtong Qi & Zhou Xu, 2024. "Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 635-656, March.
- Shahede Omidi & Jafar Fathali & Morteza Nazari, 2020. "Inverse and reverse balanced facility location problems with variable edge lengths on trees," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 261-273, June.
- Elisabeth Gassner, 2008. "The inverse 1-maxian problem with edge length modification," Journal of Combinatorial Optimization, Springer, vol. 16(1), pages 50-67, July.
- Chao Yang & Chunyan Hao & Jianzhong Zhang, 2007. "On the optimum capacity of capacity expansion problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(2), pages 225-233, October.
- Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi & Kien Trung Nguyen, 2018. "Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-22, October.
- 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.
- 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.
- Roghayeh Etemad & Behrooz Alizadeh, 2018. "Reverse selective obnoxious center location problems on tree graphs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(3), pages 431-450, June.
- Cabello, S. & Díaz-Báñez, J.M. & Langerman, S. & Seara, C. & Ventura, I., 2010. "Facility location problems in the plane based on reverse nearest neighbor queries," European Journal of Operational Research, Elsevier, vol. 202(1), pages 99-106, April.
- 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.
- Ali Reza Sepasian, 2019. "Reverse 1-maxian problem with keeping existing 1-median," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 1-13, March.
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.- 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.
- 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.
- 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.
- 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.
- Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
- Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
- 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.
- Chen, Lu & Chen, Yuyi & Langevin, André, 2021. "An inverse optimization approach for a capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1087-1098.
- Hughes, Michael S. & Lunday, Brian J., 2022. "The Weapon Target Assignment Problem: Rational Inference of Adversary Target Utility Valuations from Observed Solutions," Omega, Elsevier, vol. 107(C).
- Jia Wu & Yi Zhang & Liwei Zhang & Yue Lu, 2016. "A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-26, August.
- Jianzhong Zhang & Zhongfan Ma, 1999. "Solution Structure of Some Inverse Combinatorial Optimization Problems," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 127-139, July.
- Wei, Quanling & Zhang, Jianzhong & Zhang, Xiangsun, 2000. "An inverse DEA model for inputs/outputs estimate," European Journal of Operational Research, Elsevier, vol. 121(1), pages 151-163, February.
- 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.
- Jianzhong Zhang & Liwei Zhang & Xiantao Xiao, 2010. "A Perturbation approach for an inverse quadratic programming problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 379-404, December.
- 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.
- 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.
- 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.
- Yong He & Binwu Zhang & Enyu Yao, 2005. "Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance," Journal of Combinatorial Optimization, Springer, vol. 9(1), pages 91-100, February.
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:124:y:2000:i:1:p:77-88. 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.