{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:26:35Z","timestamp":1759667195064},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,10,15]],"date-time":"2009-10-15T00:00:00Z","timestamp":1255564800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10589-009-9294-x","type":"journal-article","created":{"date-parts":[[2009,10,14]],"date-time":"2009-10-14T16:38:22Z","timestamp":1255538302000},"page":"271-297","source":"Crossref","is-referenced-by-count":6,"title":["Inverse problems and solution methods for a class of\u00a0nonlinear complementarity problems"],"prefix":"10.1007","volume":"49","author":[{"given":"Jian-zhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-bao","family":"Jian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-ming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,15]]},"reference":[{"key":"9294_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C. Heuberger","year":"2004","unstructured":"Heuberger, C.: Inverse combinational optimization: a survey on problems, methods and results. J.\u00a0Comb. Optim. 8, 329\u2013361 (2004)","journal-title":"J.\u00a0Comb. Optim."},{"key":"9294_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":"Ahuja, R.K., Orlin, J.B.: Inverse optimization. Oper. Res. 49, 771\u2013783 (2001)","journal-title":"Oper. Res."},{"key":"9294_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"Burton, D., Toint, Ph.L.: On an instance of the inverse shortest paths problem. Math. Program. 53, 45\u201361 (1992)","journal-title":"Math. Program."},{"key":"9294_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582056","volume":"63","author":"D. Burton","year":"1994","unstructured":"Burton, D., Toint, Ph.L.: On the use of an instance of the inverse shortest paths algorithm for recovering linearly correlated costs. Math. Program. 63, 1\u201322 (1994)","journal-title":"Math. Program."},{"key":"9294_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.10048","volume":"40","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Orlin, J.B.: Combinatorial algorithms for inverse network flow problems. Networks 40, 181\u2013187 (2002)","journal-title":"Networks"},{"key":"9294_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0377-2217(02)00713-0","volume":"153","author":"R.E. Burkard","year":"2004","unstructured":"Burkard, R.E., Lin, Y., Zhang, J.: Weight reduction problems with certain bottleneck objectives. Eur. J. Oper. Res. 153, 191\u2013199 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9294_CR7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"15","author":"M.C. Cai","year":"1999","unstructured":"Cai, M.C., Yang, X.G., Zhang, J.: The complexity analysis of inverse center location problem. J. Glob. Optim. 15, 213\u2013218 (1999)","journal-title":"J. Glob. Optim."},{"key":"9294_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009829525096","volume":"3","author":"J. Zhang","year":"1999","unstructured":"Zhang, J., Ma, Z.: Solution structure of some inverse combinational optimization problems. J. Comb. Optim. 3, 127\u2013138 (1999)","journal-title":"J. Comb. Optim."},{"key":"9294_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1013807829021","volume":"6","author":"J. Zhang","year":"2002","unstructured":"Zhang, J., Liu, Z.: A general method of some inverse combinational optimization problems and its solution method under \u2113 \u221e norm. J. Comb. Optim. 6, 207\u2013222 (2002)","journal-title":"J. Comb. Optim."},{"key":"9294_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J. Zhang","year":"1996","unstructured":"Zhang, J., Liu, Z.: Calculating some inverse linear programming problems. J. Comput. Appl. Math. 72, 261\u2013273 (1996)","journal-title":"J. Comput. Appl. Math."},{"key":"9294_CR11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-0427(99)00080-1","volume":"106","author":"J. Zhang","year":"1999","unstructured":"Zhang, J., Liu, Z.: A further study on inverse linear programming problems. J. Comput. Appl. Math. 106, 345\u2013359 (1999)","journal-title":"J. Comput. Appl. Math."},{"key":"9294_CR12","unstructured":"Ahuja, R.K., Orlin, J.B.: Inverse optimization, part I: linear programming and general problems. Working paper, Sloan School of Management, MIT, Cambridge, MA (1998)"},{"key":"9294_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.orl.2004.04.007","volume":"33","author":"G. Iyengar","year":"2005","unstructured":"Iyengar, G., Kang, W.: Inverse conic programming and applications. Oper. Res. Lett. 33, 319\u2013330 (2005)","journal-title":"Oper. Res. Lett."},{"key":"9294_CR14","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/mnsc.46.7.912.12036","volume":"46","author":"S. Carr","year":"2000","unstructured":"Carr, S., Lovejoy, W.: The inverse newsvendor problem: choosing an optimal demand portfolio for capacitated resources. Manag. Sci. 46, 912\u2013927 (2000)","journal-title":"Manag. Sci."},{"key":"9294_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1018977929028","volume":"85","author":"R. Dembo","year":"1999","unstructured":"Dembo, R., Rosen, D.: The practice of portfolio replication: a practical overview of forward and inverse problems. Ann. Oper. Res. 85, 267\u2013284 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9294_CR16","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"Bazaraa, M.S., Jarvis, J.J.: Linear Programming and Network Flows, 2nd edn. Wiley, New York (1990)","edition":"2"},{"key":"9294_CR17","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr (and SifDec), a Constrained and Unconstrained Testing Environment, revisited. http:\/\/hsl.rl.ac.uk\/cuter-www"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9294-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9294-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9294-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:37Z","timestamp":1559302597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9294-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,15]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9294"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9294-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,15]]}}}