{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:58:53Z","timestamp":1760644733329,"version":"3.41.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1027305419461","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"215-228","source":"Crossref","is-referenced-by-count":11,"title":["On Inverse Problems of Optimum Perfect Matching"],"prefix":"10.1007","volume":"7","author":[{"given":"Zhenhong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5149228_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"R.K. Ahuja","year":"2000","unstructured":"R.K. Ahuja and J.B. Orlin, \u201cA faster algorithm for the inverse spanning tree problem,\u201d J. of Algorithms, vol. 34, pp. 177-193, 2000.","journal-title":"J. of Algorithms"},{"key":"5149228_CR2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"R.K. Ahuja","year":"2001","unstructured":"R.K. Ahuja and J.B. Orlin, \u201cInverse optimization,\u201d Operations Research, vol. 49, pp. 771-783, 2001.","journal-title":"Operations Research"},{"key":"5149228_CR3","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"C. Berge, \u201cTwo theorems in graph theory,\u201d in Proceedings of National Acadamy of Sciences, USA, vol. 43, pp. 842-844, 1957.","journal-title":"Proceedings of National Acadamy of Sciences, USA"},{"key":"5149228_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"D. Burton and PhL. Toint, \u201cOn an instance of the inverse shortest paths problem,\u201d Mathematical Programming, vol. 53, pp. 45-61, 1992.","journal-title":"Mathematical Programming"},{"key":"5149228_CR5","first-page":"235","volume":"45","author":"M. Cai","year":"1997","unstructured":"M. Cai and Y. Li, \u201cInverse matroid intersection problem,\u201d Mathematical Methods of Operations Research, vol. 45, pp. 235-243, 1997.","journal-title":"Mathematical Methods of Operations Research"},{"key":"5149228_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"15","author":"M. Cai","year":"1999","unstructured":"M. Cai, X. Yang, and J. Zhang, \u201cThe complexity analysis of the inverse center location problem,\u201d Journal of Global Optimization, vol. 15, pp. 213-218, 1999.","journal-title":"Journal of Global Optimization"},{"key":"5149228_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0-1 vertices,\u201d J. Res. Natl. Bur. Stand., vol. 69B, pp. 125-130, 1965.","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"5149228_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)86750-9","volume":"82","author":"Z. Hu","year":"1998","unstructured":"Z. Hu and Z. Liu, \u201cA strongly polynomial algorithm for the inverse shortest arborescence,\u201d Discrete Applied Mathematics, vol. 82, pp. 135-154, 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"5149228_CR9","volume-title":"Advances in Operations Research and Systems Engineering","author":"S. Huang","year":"1998","unstructured":"S. Huang and Z. Liu, \u201cInverse problem of minimum cost flow,\u201d in Advances in Operations Research and Systems Engineering, J. Gu, et al. (Eds.), Global Publishing Co., Hong Kong, 1998."},{"key":"5149228_CR10","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt. Rinehart and Winston, New York, 1976."},{"key":"5149228_CR11","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"5149228_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0377-2217(99)00007-7","volume":"121","author":"Q. Wei","year":"2000","unstructured":"Q. Wei, J. Zhang, and X. Zhang, \u201cAn inverse DEA model for inputs\/outputs estimation,\u201d European Journal of Operational Research, vol. 121, pp. 151-163, 2000.","journal-title":"European Journal of Operational Research"},{"key":"5149228_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","volume":"12","author":"S. Xu","year":"1995","unstructured":"S. Xu and J. Zhang, \u201cAn inverse problem of the weighted shortest path problem,\u201d Japan Journal of Industrial and Applied Mathematics, vol. 12, pp. 47-59, 1995.","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"key":"5149228_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"C. Yang","year":"1997","unstructured":"C. Yang and J. Zhang, \u201cInverse maximum flow and minimum cut problems,\u201d Optimization, vol. 40, pp. 147-170, 1997.","journal-title":"Optimization"},{"key":"5149228_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01539860","volume":"20","author":"C. Yang","year":"1998","unstructured":"C. Yang and J. Zhang, \u201cInverse maximum capacity problem,\u201d Operations Research Spektrum, vol. 20, pp. 97-100, 1998.","journal-title":"Operations Research Spektrum"},{"key":"5149228_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/00207169808804733","volume":"70","author":"C. Yang","year":"1998","unstructured":"C.Yang and J. Zhang, \u201cAconstrained capacity expansion problem on networks,\u201d International Journal of Computer Mathematics, vol. 70, pp. 19-33, 1998.","journal-title":"International Journal of Computer Mathematics"},{"key":"5149228_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0893-9659(98)00151-7","volume":"12","author":"C. Yang","year":"1999","unstructured":"C. Yang and J. Zhang, \u201cTwo general methods for inverse optimization problems,\u201d Applied Mathematics Letters, vol. 12, pp. 69-72, 1999.","journal-title":"Applied Mathematics Letters"},{"key":"5149228_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01193836","volume":"48","author":"J. Zhang","year":"1998","unstructured":"J. Zhang and M. Cai, \u201cInverse problem of minimum cuts,\u201d Mathematical Methods of Operations Research, vol. 48, pp. 51-58, 1998.","journal-title":"Mathematical Methods of Operations Research"},{"key":"5149228_CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J. Zhang","year":"1996","unstructured":"J. Zhang and Z. Liu, \u201cCalculating some inverse linear programming problems,\u201d J. Computational and Applied Mathematics, vol. 72, pp. 261-273, 1996.","journal-title":"J. Computational and Applied Mathematics"},{"key":"5149228_CR20","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-0427(99)00080-1","volume":"106","author":"J. Zhang","year":"1999","unstructured":"J. Zhang and Z. Liu, \u201cA further study on inverse linear programming problems,\u201d J. Computational and Applied Mathematics, vol. 106, pp. 345-359, 1999.","journal-title":"J. Computational and Applied Mathematics"},{"key":"5149228_CR21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01194328","volume":"44","author":"J. Zhang","year":"1996","unstructured":"J. Zhang, Z. Liu, and Z. Ma, \u201cOn inverse problem of minimum spanning tree with partition constraints,\u201d Mathematical Methods of Operations Research, vol. 44, pp. 347-358, 1996.","journal-title":"Mathematical Methods of Operations Research"},{"key":"5149228_CR22","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1017\/S0334270000010572","volume":"40","author":"J. Zhang","year":"1999","unstructured":"J. Zhang, Z. Liu, and Z. Ma, \u201cInverse fractional matching problem,\u201d The Journal of Australia Mathematics Society, Ser. B: Applied Mathematics, vol. 40, pp. 484-496, 1999.","journal-title":"The Journal of Australia Mathematics Society, Ser. B: Applied Mathematics"},{"key":"5149228_CR23","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J. Zhang","year":"1995","unstructured":"J. Zhang, Z. Ma, and C. Yang, \u201cA column generation method for inverse shortest path problem,\u201d Mathematical Methods of Operations Research, vol. 41, pp. 347-358, 1995.","journal-title":"Mathematical Methods of Operations Research"},{"key":"5149228_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"J. Zhang","year":"1996","unstructured":"J. Zhang and Z. Ma, \u201cA network flow method for solving inverse combinatorial optimization problems,\u201d Optimization, vol. 37, pp. 59-72, 1996.","journal-title":"Optimization"},{"key":"5149228_CR25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009829525096","volume":"3","author":"J. Zhang","year":"1999","unstructured":"J. Zhang and Z. Ma, \u201cSolution structure of some inverse optimization problems,\u201d Journal of Combinatorial Optimization, vol. 3, pp. 127-139, 1999.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5149228_CR26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J. Zhang","year":"1997","unstructured":"J. Zhang, S. Xu, and Z. Ma, \u201cAn algorithm for inverse minimum spanning tree problem,\u201d Optimization Methods and Software, vol. 8, pp. 69-84, 1997.","journal-title":"Optimization Methods and Software"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027305419461.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027305419461\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027305419461.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:47:29Z","timestamp":1751284049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027305419461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5149228"],"URL":"https:\/\/doi.org\/10.1023\/a:1027305419461","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}