{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T11:05:50Z","timestamp":1769339150847,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681380","type":"print"},{"value":"9783540681410","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_28","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"307-318","source":"Crossref","is-referenced-by-count":8,"title":["Ranking Sports Teams and the Inverse Equal Paths Problem"],"prefix":"10.1007","author":[{"given":"Dorit S.","family":"Hochbaum","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1287\/mnsc.32.12.1642","volume":"32","author":"I. Ali","year":"1986","unstructured":"Ali, I., Cook, W.D., Kress, M.: Ordinal ranking and intensity of preference: a linear programming approach. Management Science\u00a032, 1642\u20131647 (1986)","journal-title":"Management Science"},{"key":"28_CR2","doi-asserted-by":"publisher","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. Operations Research\u00a049, 771\u2013783 (2001)","journal-title":"Operations Research"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1287\/mnsc.49.7.950.16384","volume":"49","author":"R.K. Ahuja","year":"2003","unstructured":"Ahuja, R.K., Hochbaum, D.S., Orlin, J.B.: Solving the convex cost integer dual of minimum cost network flow problem. Management Science\u00a049, 950\u2013964 (2003)","journal-title":"Management Science"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00453-004-1085-2","volume":"39","author":"R.K. Ahuja","year":"2004","unstructured":"Ahuja, R.K., Hochbaum, D.S., Orlin, J.B.: A cut based algorithm for the nonlinear dual of the minimum cost network flow problem. Algorithmica\u00a039, 189\u2013208 (2004)","journal-title":"Algorithmica"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1038\/nphys324","volume":"2","author":"M. Buchanan","year":"2006","unstructured":"Buchanan, M.: Top rank. Nature Physics\u00a02, 361 (2006)","journal-title":"Nature Physics"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Mathematical Programming\u00a053, 45\u201361 (1992)","journal-title":"Mathematical Programming"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582056","volume":"63","author":"D. Burton","year":"1994","unstructured":"Burton, D., Toint, P.L.: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Mathematical Programming\u00a063, 1\u201322 (1994)","journal-title":"Mathematical Programming"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1016\/j.cor.2004.02.010","volume":"32","author":"B. Chandran","year":"2005","unstructured":"Chandran, B., Golden, B., Wasil, E.: Linear programming models for estimating weights in the analytic hierarchy process. Computers and Operations Research\u00a032, 2213\u20132234 (2005)","journal-title":"Computers and Operations Research"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Chen, P., Xie, H., Maslov, S., Redner, S.: Finding scientific gems with Google 1, 18 (2006) arXuv:physics\/0604130","DOI":"10.1016\/j.joi.2006.06.001"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/15427951.2004.10129090","volume":"1","author":"S. Chien","year":"2004","unstructured":"Chien, S., Dwork, C., Kumar, R., Simon, D.R., Sivakumar, D.: Link Evolution: Analysis and Algorithms. Internet Mathematics\u00a01, 277\u2013304 (2004)","journal-title":"Internet Mathematics"},{"key":"28_CR11","volume-title":"The Method of Paired Comparisons","author":"H.A. David","year":"1988","unstructured":"David, H.A.: The Method of Paired Comparisons, 2nd edn. Charles Griffin and Company Ltd. and Oxford University Press, London (1988)","edition":"2"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Levin, A.: Methodologies and algorithms for group rankings decision. Management Science (to appear)","DOI":"10.1287\/mnsc.1060.0540"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D.S. Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex Separable Optimization is not Much Harder Than Linear Optimization. Journal of the ACM\u00a037, 843\u2013862 (1990)","journal-title":"Journal of the ACM"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1145\/502090.502093","volume":"48","author":"D.S. Hochbaum","year":"2001","unstructured":"Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov Random Fields and related problems. Journal of the ACM\u00a048, 686\u2013701 (2001)","journal-title":"Journal of the ACM"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1137\/1035004","volume":"35","author":"J.P. Keener","year":"1993","unstructured":"Keener, J.P.: The Perron-Frobenius theorem and the ranking of football teams. SIAM Review\u00a035, 80\u201393 (1993)","journal-title":"SIAM Review"},{"key":"28_CR16","unstructured":"Kemeny, J.G., Snell, J.L.: Preference ranking: An axiomatic approach. In: Mathematical models in the social sciences, Boston, Ginn, pp. 9\u201323 (1962)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, J.: Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 14\u201323 (1999)","DOI":"10.1109\/SFFCS.1999.814572"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/S0377-2217(02)00430-7","volume":"148","author":"P. Laininen","year":"2003","unstructured":"Laininen, P., H\u00e4m\u00e4\u00e4inen, R.P.: Analyzing AHP-matrices by regression. European Journal of Operational Research\u00a0148, 514\u2013524 (2003)","journal-title":"European Journal of Operational Research"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Park, J., Newman, M.E.J.: A network-based ranking system for US college football 4, 31 (2005) arXiv:physics\/0505169","DOI":"10.1088\/1742-5468\/2005\/10\/P10014"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0022-2496(77)90033-5","volume":"15","author":"T. Saaty","year":"1977","unstructured":"Saaty, T.: A scaling method for priorities in hierarchical structures. Journal of Math. Psychology\u00a015, 234\u2013281 (1977)","journal-title":"Journal of Math. Psychology"},{"key":"28_CR21","volume-title":"The Analytic Hierarchy Process","author":"T. Saaty","year":"1980","unstructured":"Saaty, T.: The Analytic Hierarchy Process. McGraw-Hill, New York (1980)"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0270-0255(84)90008-3","volume":"5","author":"T. Saaty","year":"1984","unstructured":"Saaty, T., Vargas, L.G.: Comparison of eigenvalue, logarithmic least squares and least squares methods in estimating ratios. Journal of Mathematical Modeling\u00a05, 309\u2013324 (1984)","journal-title":"Journal of Mathematical Modeling"},{"key":"28_CR23","volume-title":"Matrix Iterative Analysis","author":"R.S. Vargas","year":"1962","unstructured":"Vargas, R.S.: Matrix Iterative Analysis. Prentice Hall, Englewood Cliffs (1962)"},{"key":"28_CR24","unstructured":"Wang, Y.M., Yang, J.B., Xu, D.L.: Mathematical Programming Methods for Generating weights from Interval Comparison Matrices. Internet (retrieved, July 2004), http:\/\/www.sm.umist.ac.uk\/wp\/abstract\/wp0205.htm"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J. Zhang","year":"1995","unstructured":"Zhang, J., Ma, Z., Yang, C.: A column generation method for inverse shortest paths problems. J. ZOR Mathematical Methods of Operations Research\u00a041, 347\u2013358 (1995)","journal-title":"J. ZOR Mathematical Methods of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:57Z","timestamp":1619507877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11944874_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}