{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:01Z","timestamp":1759637761468},"reference-count":10,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1051\/ro:2001106","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T03:42:52Z","timestamp":1069213372000},"page":"117-126","source":"Crossref","is-referenced-by-count":21,"title":["Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem"],"prefix":"10.1051","volume":"35","author":[{"given":"Xiaoguang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","unstructured":"R.K. Ahuja and J.B. Orlin,Inverse optimization, Part I: Linear programming and general problems, Working Paper, SWP#4002. Sloan School of Management, MIT, Cambridge, MA (1998)."},{"key":"R2","unstructured":"R.K. Ahuja and J.B. Orlin,Inverse optimization, Part II: Network flow problems, Working Paper, SWP#4003. Sloan School of Management, MIT, Cambridge, MA (1998)."},{"key":"R3","unstructured":"R.K. Ahuja and J.B. Orlin,Combinatorial algorithms for inverse network flow problems, Working Paper, SWP#4004. Sloan School of Management, MIT, Cambridge, MA (1998)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1009877408258","volume":"3","author":"Cai","year":"1999","journal-title":"J. Comb. Optim."},{"key":"R5","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1023\/A:1004685508517","volume":"104","author":"Cai","year":"2000","journal-title":"J. Optim. Theory Appl."},{"key":"R6","unstructured":"M. Cai, X. Yang and J. Zhang,Inverse problems with partial given solution, Working Paper. Department of Mathematics, City University of Hong Kong (1997)."},{"key":"R7","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide of the Theory of NP-Completeness. Freeman, San Francisco (1979)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"Yang","year":"1997","journal-title":"Optimization"},{"key":"R9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01193836","volume":"48","author":"Zhang","year":"1998","journal-title":"ZOR-Math. Methods Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"Zhang","year":"1996","journal-title":"Optimization"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001106\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:21:34Z","timestamp":1497565294000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ro2101"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001106","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}