{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T17:51:28Z","timestamp":1690307488494},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T00:00:00Z","timestamp":1535068800000},"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":[[2020,4]]},"DOI":"10.1007\/s10479-018-3018-5","type":"journal-article","created":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T15:48:12Z","timestamp":1535125692000},"page":"643-651","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On solving a non-convex quadratic programming problem involving resistance distances in graphs"],"prefix":"10.1007","volume":"287","author":[{"given":"Dipti","family":"Dubey","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":[[2018,8,24]]},"reference":[{"key":"3018_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-981-7","volume-title":"Graphs and matrices","author":"RB Bapat","year":"2010","unstructured":"Bapat, R. B. (2010). Graphs and matrices. London: Universitext, Springer."},{"key":"3018_CR2","first-page":"87","volume":"68","author":"RB Bapat","year":"1999","unstructured":"Bapat, R. B. (1999). Resistance distance in graphs. Mathematics Student, 68, 87\u201398.","journal-title":"Mathematics Student"},{"key":"3018_CR3","first-page":"214","volume":"65","author":"RB Bapat","year":"1996","unstructured":"Bapat, R. B. (1996). The Laplacian matrix of a graph. Mathematics Student, 65, 214\u2013223.","journal-title":"Mathematics Student"},{"key":"3018_CR4","first-page":"73","volume":"50","author":"RB Bapat","year":"2004","unstructured":"Bapat, R. B. (2004). Resistance matrix of a weighted graph. MATCH-Communications in Mathematical and in Computer Chemistry, 50, 73\u201382.","journal-title":"MATCH-Communications in Mathematical and in Computer Chemistry"},{"key":"3018_CR5","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1515\/zna-2003-9-1003","volume":"58","author":"RB Bapat","year":"2003","unstructured":"Bapat, R. B., Gutmana, I., & Xiao, W. (2003). A simple method for computing resistance distance. Zeitschrift f\u00fcr Naturforschung A, 58, 494\u2013498.","journal-title":"Zeitschrift f\u00fcr Naturforschung A"},{"key":"3018_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10479-014-1743-y","volume":"243","author":"RB Bapat","year":"2016","unstructured":"Bapat, R. B., & Neogy, S. K. (2016). On a quadratic programming problem involving distances in trees. Annals of Operations Research, 243, 365\u2013373.","journal-title":"Annals of Operations Research"},{"key":"3018_CR7","doi-asserted-by":"publisher","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"},{"key":"3018_CR8","doi-asserted-by":"publisher","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, 394\u2013414.","journal-title":"SIAM Review"},{"key":"3018_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"IM Bomze","year":"2008","unstructured":"Bomze, I. M., Locatelli, M., & Tardella, F. (2008). New and old bounds for standard quadratic optimization: Dominance, equivalence and incomparability. Mathematical Programming, 115, 31\u201364.","journal-title":"Mathematical Programming"},{"key":"3018_CR10","volume-title":"The linear complementarity problem","author":"RW Cottle","year":"2012","unstructured":"Cottle, R. W., Pang, J. S., & Stone, R. E. (2012). The linear complementarity problem. New York: Academic Press."},{"key":"3018_CR11","doi-asserted-by":"publisher","first-page":"12","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, 12\u201320.","journal-title":"Discrete Mathematics"},{"key":"3018_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199591756.001.0001","volume-title":"The structure of complex networks: Theory and applications","author":"E Estrada","year":"2011","unstructured":"Estrada, E. (2011). The structure of complex networks: Theory and applications. New York: Oxford University Press."},{"key":"3018_CR13","doi-asserted-by":"publisher","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":"3018_CR14","doi-asserted-by":"publisher","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":"3018_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"D Klein","year":"1993","unstructured":"Klein, D., & Randi\u0107, M. (1993). Resistance distance. Journal of Mathematical Chemistry, 12, 81\u201395.","journal-title":"Journal of Mathematical Chemistry"},{"key":"3018_CR16","doi-asserted-by":"publisher","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":"3018_CR17","doi-asserted-by":"publisher","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":"3018_CR18","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-247X(64)90021-6","volume":"9","author":"OL Mangasarian","year":"1964","unstructured":"Mangasarian, O. L., & Stone, H. (1964). Two-person nonzero-sum games and quadratic programming. Journal of Mathematical Analysis and Applications, 9, 348\u2013355.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"3018_CR19","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1016\/j.dam.2007.09.020","volume":"156","author":"A Scozzari","year":"2008","unstructured":"Scozzari, A., & Tardella, F. (2008). A clique algorithm for standard quadratic programming. Discrete Applied Mathematics, 156, 2439\u20132448.","journal-title":"Discrete Applied Mathematics"},{"key":"3018_CR20","doi-asserted-by":"publisher","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, 250\u2013256.","journal-title":"Operations Research"},{"key":"3018_CR21","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00214-003-0460-4","volume":"110","author":"W Xiao","year":"2003","unstructured":"Xiao, W., & Gutman, I. (2003). Resistance distance and Laplacian spectrum. Theoretical Chemistry Accounts, 110, 284\u2013289.","journal-title":"Theoretical Chemistry Accounts"},{"key":"3018_CR22","first-page":"67","volume":"49","author":"W Xiao","year":"2003","unstructured":"Xiao, W., & Gutman, I. (2003). On resistance matrices. MATCH Communications in Mathematical and in Computer Chemistry, 49, 67\u201381.","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3018-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3018-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3018-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T14:32:19Z","timestamp":1584023539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3018-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,24]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["3018"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3018-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,24]]},"assertion":[{"value":"24 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}