IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v7y2003i3d10.1023_a1027305419461.html
   My bibliography  Save this article

On Inverse Problems of Optimum Perfect Matching

Author

Listed:
  • Zhenhong Liu

    (Institute of Systems Science, Academia Sinica)

  • Jianzhong Zhang

    (City University of Hong Kong)

Abstract

As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l 1 or l ∞ norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l 1 and l ∞ norms. It has been proved that the inverse maximum-weight perfect matching under l ∞ norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l 1 norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l 1 and l ∞ norms are solvable in polynomial time.

Suggested Citation

  • Zhenhong Liu & Jianzhong Zhang, 2003. "On Inverse Problems of Optimum Perfect Matching," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 215-228, September.
    • Handle: RePEc:spr:jcomop:v:7:y:2003:i:3:d:10.1023_a:1027305419461
    DOI: 10.1023/A:1027305419461
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1027305419461
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1027305419461?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qin Wang & Tianyu Yang & Longshu Wu, 2022. "General restricted inverse assignment problems under $$l_1$$ l 1 and $$l_\infty $$ l ∞ norms," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 2040-2055, October.
    2. Qin Wang & Tianyu Yang & Longshu Wu, 0. "General restricted inverse assignment problems under $$l_1$$l1 and $$l_\infty $$l∞ norms," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-16.
    3. 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.

    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.
    1. 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.
    2. Zhang, Jianzhong & Liu, Zhenhong & Ma, Zhongfan, 2000. "Some reverse location problems," European Journal of Operational Research, Elsevier, vol. 124(1), pages 77-88, July.
    3. 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.
    4. Wen-Chi Yang & Wen-Min Lu, 2023. "Achieving Net Zero—An Illustration of Carbon Emissions Reduction with A New Meta-Inverse DEA Approach," IJERPH, MDPI, vol. 20(5), pages 1-20, February.
    5. 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.
    6. 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.
    7. Luning Shao & Jianxin You & Tao Xu & Yilei Shao, 2020. "Non-Parametric Model for Evaluating the Performance of Chinese Commercial Banks’ Product Innovation," Sustainability, MDPI, vol. 12(4), pages 1-15, February.
    8. Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
    9. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    10. Ghiyasi, Mojtaba & Soltanifar, Mehdi & Sharafi, Hamid, 2022. "A novel inverse DEA-R model with application in hospital efficiency," Socio-Economic Planning Sciences, Elsevier, vol. 84(C).
    11. 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.
    12. Vincent Mousseau & Özgür Özpeynirci & Selin Özpeynirci, 2018. "Inverse multiple criteria sorting problem," Annals of Operations Research, Springer, vol. 267(1), pages 379-412, August.
    13. 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.
    14. Jun-Fei Chu & Jie Wu & Ma-Lin Song, 2018. "An SBM-DEA model with parallel computing design for environmental efficiency evaluation in the big data context: a transportation system application," Annals of Operations Research, Springer, vol. 270(1), pages 105-124, November.
    15. Meng Zhang & Jin-chuan Cui, 2016. "The extension and integration of the inverse DEA method," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(9), pages 1212-1220, September.
    16. 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).
    17. 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.
    18. Liang Hou & Roger J. Jiao, 2020. "Data-informed inverse design by product usage information: a review, framework and outlook," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 529-552, March.
    19. Yu, Yantuan & Zhang, Ning, 2021. "Low-carbon city pilot and carbon emission efficiency: Quasi-experimental evidence from China," Energy Economics, Elsevier, vol. 96(C).
    20. Ehrgott, Matthias & Holder, Allen & Nohadani, Omid, 2018. "Uncertain Data Envelopment Analysis," European Journal of Operational Research, Elsevier, vol. 268(1), pages 231-242.

    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:spr:jcomop:v:7:y:2003:i:3:d:10.1023_a:1027305419461. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.