{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T11:50:18Z","timestamp":1775476218586,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00444-x","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"421-426","source":"Crossref","is-referenced-by-count":20,"title":["On the inverse problem of linear programming and its application to minimum weight perfect k-matching"],"prefix":"10.1016","volume":"112","author":[{"given":"Siming","family":"Huang","sequence":"first","affiliation":[]},{"given":"Zhenhong","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00444-X_BIB1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","article-title":"On an instance of the inverse shortest paths problem","volume":"53","author":"Burton","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0377-2217(97)00444-X_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582056","article-title":"On the use of an inverse shortest paths algorithm for recovering linearly correlated costs","volume":"63","author":"Burton","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0377-2217(97)00444-X_BIB3","unstructured":"D. Burton, B. Pulleyblank, Ph.L. Toint, The inverse shortest paths problem with upper bounds on shortest paths costs, Working paper, Department of Mathematics, Facultes Universitaires ND de la Paix, B-5000 Namur, Belgium, 1994"},{"key":"10.1016\/S0377-2217(97)00444-X_BIB4","unstructured":"Z.F. Ma, J.Z. Zhang, On inverse combinatorial optimization problems, Working paper, Department of Mathematics, City Polytechnic of Hong Kong"},{"key":"10.1016\/S0377-2217(97)00444-X_BIB5","unstructured":"Z. Hu, Z. Liu, A strongly polynomial algorithm for the inverse shortest arborescence problem, Working Paper, Institute of Systems Science, Academia Sinica, Beijing 100080, People's Republic of China"},{"key":"10.1016\/S0377-2217(97)00444-X_BIB6","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","article-title":"A strongly polynomial algorithm to solve combinatorial linear programs","volume":"34","author":"Tardos","year":"1986","journal-title":"Oper. Res."},{"key":"10.1016\/S0377-2217(97)00444-X_BIB7","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993"},{"key":"10.1016\/S0377-2217(97)00444-X_BIB8","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/S0377-2217(97)00444-X_BIB9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/nav.3800030404","article-title":"Variants of the Hungarian method for assignment problems","volume":"3","author":"Kuhn","year":"1956","journal-title":"Naval Res. Logist."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700444X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700444X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T12:56:47Z","timestamp":1556369807000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179700444X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S037722179700444X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00444-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}