{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:20:40Z","timestamp":1773692440725,"version":"3.50.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00235-4","type":"journal-article","created":{"date-parts":[[2002,10,30]],"date-time":"2002-10-30T16:44:51Z","timestamp":1035996291000},"page":"83-98","source":"Crossref","is-referenced-by-count":27,"title":["Inverse optimization in high-speed networks"],"prefix":"10.1016","volume":"129","author":[{"given":"Andr\u00e1s","family":"Farag\u00f3","sequence":"first","affiliation":[]},{"given":"\u00c1ron","family":"Szentesi","sequence":"additional","affiliation":[]},{"given":"Bal\u00e1zs","family":"Szviatovszki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00235-4_BIB1","unstructured":"R.K. Ahuja, J.B. Orlin, Solving the convex ordered set problem with applications to isotonic regression, Working Paper SWP# 3988, MIT Sloan School of Management, Cambridge, MA, 1997."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB2","unstructured":"R.K. Ahuja, J.B. Orlin, Inverse optimization, Part I: linear programming and general problem, Working Paper SWP# 4002, MIT Sloan School of Management, Cambridge, MA, 1998."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB3","unstructured":"R.K. Ahuja, J.B. Orlin, A fast algorithm for the bipartite node weighted matching problem on path graphs with application to the inverse spanning tree problem, Working Paper SWP# 4006, MIT Sloan School of Management, Cambridge, MA, 1998."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB4","doi-asserted-by":"crossref","unstructured":"D. Burton, B. Pulleyblank, Ph.L. Toint, The inverse shortest path problem with upper bounds on shortest paths costs, in: P. Bartalos, D.W. Hear, W.H. Hager (Eds.), Network Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 450, pp. 156\u2013171.","DOI":"10.1007\/978-3-642-59179-2_8"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","article-title":"On an instance of the inverse shortest path problem","volume":"53","author":"Burton","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582056","article-title":"On the use of an inverse shortest path algorithm for recovering linearly correlated costs","volume":"63","author":"Burton","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB7","unstructured":"M. Cai, X. Yang, Inverse shortest path problems, Technical Report, Institute of Systems Sciences, Academia Sinica, Beijing, China, 1994."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB8","unstructured":"M. Cai, X. Yang, Y. Li, Inverse polymatroidal flow problem, Research Report, Institute of Systems Science, Chinese Academy of Science, Beijing, China, 1996."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB9","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/49.414639","article-title":"A new degree of freedom in ATM network dimensioning: optimizing the logical configuration","volume":"13","author":"Farag\u00f3","year":"1995","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB10","series-title":"Routing and Dimensioning in Circuit-switched Networks","author":"Girard","year":"1990"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB11","unstructured":"Zs. Haraszti, I. Dahlquist, A Farag\u00f3, T. Henk, PLASMA\u2014an integrated tool for ATM network operation, International Switching Symposium (ISS\u201995), Berlin, 1995, pp. 314\u2013318."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB12","unstructured":"Z. Hu, Z. Liu, A strongly polynomial algorithm for the inverse shortest arborescence problem, Working Paper, Institute of Systems Sciences, Academia Sinica, Beijing, China, 1995."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB13","unstructured":"S. Hunag, Z. Liu, On the inverse problem of k-matching of bipartite graphs, Working Paper, School of Business and Management, Hong Kong University of Science and Technology, Hong Kong, 1995."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB14","unstructured":"S. Hunag, Z. Liu, On the inverse version of the minimum cost flow problem, Working Paper, School of Business and Management, Hong Kong University of Science and Technology, Hong Kong, 1995."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB15","unstructured":"Y. Li, Inverse combinatorial optimization problems and connected factor problems, Dissertation, Institute of Systems Science, Chinese Academy of Science, Beijing, China, 1996."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB16","unstructured":"Z. Ma, S. Xu, J. Zhang, Algorithms for inverse minimum spanning tree problem, Working Paper, Department of Mathematics, City Polytechnic of Hong Kong, Hong Kong, 1996."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB17","unstructured":"Private Network\u2013Network Interface Specification, Version 1.0 (PNNI 1.0), The ATM Forum, Technical Committee, March 1996."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB18","doi-asserted-by":"crossref","unstructured":"J. Roberts, U. Mocci, J. Virtamo (Eds.), Broadband Network Traffic, Springer, Berlin, 1996.","DOI":"10.1007\/3-540-61815-5"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB19","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1990"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB20","unstructured":"P.T. Sokkalingam, The minimum cost flow problem: primal algorithms and cost perturbations, Dissertation, Department of Mathematics, Indian Institute of Technology, Kanpur, India, 1996."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB21","unstructured":"P.T. Sokkalingam, R.K. Ahuja, J.B. Orlin, Solving the inverse spanning tree problems through network flow techniques, Working Paper SWP# 3890, MIT Sloan School of Management, Cambridge, MA, 1996."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB22","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\/S0166-218X(02)00235-4_BIB23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","article-title":"An inverse problem of the weighted shortest path problem","volume":"12","author":"Xu","year":"1995","journal-title":"Japan J. Ind. Appl. Math."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","article-title":"Inverse maximum flow and minimum cut problem","volume":"40","author":"Yang","year":"1997","journal-title":"Optimization"},{"key":"10.1016\/S0166-218X(02)00235-4_BIB25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01193836","article-title":"Inverse problem of minimum cuts","volume":"47","author":"Zhang","year":"1998","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/S0166-218X(02)00235-4_BIB26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","article-title":"A column generation method for inverse shortest path problems","volume":"41","author":"Zhang","year":"1995","journal-title":"ZOR-Math. Methods Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002354?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T09:25:29Z","timestamp":1555147529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02002354"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00235-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}