{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T19:54:02Z","timestamp":1651780442894},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,10,16]],"date-time":"2014-10-16T00:00:00Z","timestamp":1413417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10479-014-1743-y","type":"journal-article","created":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T16:26:50Z","timestamp":1413390410000},"page":"365-373","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On a quadratic programming problem involving distances in trees"],"prefix":"10.1007","volume":"243","author":[{"given":"R. B.","family":"Bapat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"Neogy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,16]]},"reference":[{"key":"1743_CR1","doi-asserted-by":"crossref","unstructured":"Bapat, R. B. (2010). Graphs and matrices. London\/New Delhi: Springer\/Hindustan Book Agency.","DOI":"10.1007\/978-1-84882-981-7"},{"key":"1743_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511529979","volume-title":"Nonnegative matrices and applications, encyclopedia of mathematics and its applications","author":"RB Bapat","year":"1997","unstructured":"Bapat, R. B., & Raghavan, T. E. S. (1997). Nonnegative matrices and applications, encyclopedia of mathematics and its applications (Vol. 64). Cambridge: Cambridge University Press."},{"key":"1743_CR3","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1016\/j.laa.2011.03.028","volume":"435","author":"RB Bapat","year":"2011","unstructured":"Bapat, R. B., & Sivasubramanian, S. (2011). Identities for minors of the Laplacian, resistance and distance matrices. Linear Algebra and its Applications, 435, 1479\u20131489.","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"1743_CR4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1137\/S00361445003756","volume":"44","author":"IM Bomze","year":"2002","unstructured":"Bomze, I. M. (2002). Regularity versus degeneracy in dynamics, games and optimization: A unified approach to different aspects. SIAM Review, 44(3), 394\u2013414.","journal-title":"SIAM Review"},{"key":"1743_CR5","volume-title":"The linear complementarity problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R. W., Pang, J. S., & Stone, R. E. (1992). The linear complementarity problem. New York: Academic Press."},{"key":"1743_CR6","doi-asserted-by":"crossref","unstructured":"Chung, F. R. K. (1986). Diameters of communication networks. Mathematics of information processing (Louisville, Ky., 1984). In Proceedings of the symposia in applied mathematics (Vol. 34, pp. 1\u201318). Providence, RI: American Mathematical Society.","DOI":"10.1090\/psapm\/034\/846852"},{"key":"1743_CR7","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1016\/j.disc.2011.02.010","volume":"312","author":"P Dankelmann","year":"2012","unstructured":"Dankelmann, P. (2012). Average distance in weighted graphs. Discrete Mathematics, 312, 1220.","journal-title":"Discrete Mathematics"},{"key":"1743_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01585740","volume":"46","author":"F Granot","year":"1990","unstructured":"Granot, F., & Skorin-Kapov, J. (1990). Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos\u2019 algorithm. Mathematical Programming, 46, 225\u2013236.","journal-title":"Mathematical Programming"},{"key":"1743_CR9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0024-3795(97)00242-5","volume":"270","author":"P Hjorth","year":"1998","unstructured":"Hjorth, P., Lison\u011bk, P., Markvorsen, S., & Thomassen, c. (1998). Finite metric spaces of strictly negative type. Linear Algebra and its Applications, 270, 255\u2013273.","journal-title":"Linear Algebra and its Applications"},{"key":"1743_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., & Yoshise, A. (1989). A polynomial-time algorithm for a class of linear complementarity problems. Mathematical Programming, 44, 1\u201326.","journal-title":"Mathematical Programming"},{"key":"1743_CR11","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"CE Lemke","year":"1965","unstructured":"Lemke, C. E. (1965). Bimatrix equilibrium points and mathematical programming. Management Science, 11, 681\u2013689.","journal-title":"Management Science"},{"key":"1743_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K. G., & Kabadi, S. N. (1987). Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39, 117\u2013129.","journal-title":"Mathematical Programming"},{"key":"1743_CR13","first-page":"567","volume-title":"Proceedings of the Princeton symposium on mathematical programming","author":"TD Parsons","year":"1970","unstructured":"Parsons, T. D. (1970). Applications of principal pivoting. In H. W. Kuhn (Ed.), Proceedings of the Princeton symposium on mathematical programming (pp. 567\u2013581). Princeton, NJ: Princeton University Press."},{"issue":"2","key":"1743_CR14","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"E Tardos","year":"1986","unstructured":"Tardos, E. (1986). A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34(2), 250\u2013256.","journal-title":"Operations Research"},{"key":"1743_CR15","volume-title":"Introduction to graph theory","author":"D West","year":"2001","unstructured":"West, D. (2001). Introduction to graph theory (2nd ed.). Englewood Cliffs, NJ: Prentice-Hall.","edition":"2"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1743-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1743-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1743-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:54Z","timestamp":1559153394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1743-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,16]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["1743"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1743-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,16]]}}}