{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T04:37:33Z","timestamp":1716352653045},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1016\/j.orl.2017.03.004","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T21:06:21Z","timestamp":1489179981000},"page":"232-237","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis"],"prefix":"10.1016","volume":"45","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-4616-2932","authenticated-orcid":false,"given":"Ante","family":"\u0106usti\u0107","sequence":"first","affiliation":[]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2017.03.004_br000005","series-title":"Approximation Algorithms and Metaheuristics","article-title":"Very large scale neighborhood search: theory, algorithms and applications","author":"Ahuja","year":"2007"},{"key":"10.1016\/j.orl.2017.03.004_br000010","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.jalgor.2003.09.003","article-title":"Algorithms with large domination ratio","volume":"50","author":"Alon","year":"2004","journal-title":"J. Algorithms"},{"key":"10.1016\/j.orl.2017.03.004_br000015","first-page":"741","article-title":"Bilinear programming","volume":"16","author":"Altman","year":"1968","journal-title":"Bull. Acad. Pol. Sci."},{"key":"10.1016\/j.orl.2017.03.004_br000020","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0166-218X(97)00129-7","article-title":"On the quality of local search for the quadratic assignment problem","volume":"82","author":"Angel","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2017.03.004_br000025","series-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"\u00c7ela","year":"1998"},{"key":"10.1016\/j.orl.2017.03.004_br000030","author":"\u0106usti\u0107","year":"2017","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2017.03.004_br000035","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s101070050010","article-title":"A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem","volume":"87","author":"De\u012dneko","year":"2000","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2017.03.004_br000040","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","article-title":"The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms","volume":"48","author":"Glover","year":"1997","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.orl.2017.03.004_br000045","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-6377(92)90049-9","article-title":"Local search and the local structure of NP-complete problems","volume":"12","author":"Grover","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2017.03.004_br000050","doi-asserted-by":"crossref","first-page":"2613","DOI":"10.1016\/j.dam.2006.02.010","article-title":"Domination analysis for minimum multiprocessor scheduling","volume":"154","author":"Gutin","year":"2006","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2017.03.004_br000055","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0166-218X(03)00359-7","article-title":"Domination analysis of combinatorial optimization problems","volume":"129","author":"Gutin","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2017.03.004_br000060","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00053-0","article-title":"TSP tour domination and Hamilton cycle decompositions of regular graphs","volume":"28","author":"Gutin","year":"2001","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2017.03.004_br000065","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0166-218X(01)00267-0","article-title":"Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number","volume":"119","author":"Gutin","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2017.03.004_br000070","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1006\/jagm.2001.1187","article-title":"z-Approximations","volume":"41","author":"Hassin","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/j.orl.2017.03.004_br000075","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01580380","article-title":"Maximization of a convex quadratic function under linear constraints","volume":"11","author":"Konno","year":"1976","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2017.03.004_br000080","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00253808","article-title":"Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial","volume":"1","author":"Konno","year":"1992","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2017.03.004_br000085","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.aim.2013.01.005","article-title":"Hamilton decompositions of regular expanders: a proof of Kelly\u2019s conjecture for large tournaments","volume":"237","author":"Kuhn","year":"2013","journal-title":"Adv. Math."},{"key":"10.1016\/j.orl.2017.03.004_br000090","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.disc.2003.05.008","article-title":"Domination analysis of greedy heuristics for the frequency assignment problem","volume":"275","author":"Koller","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.orl.2017.03.004_br000095","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.disopt.2009.04.004","article-title":"Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem","volume":"6","author":"Mitrovi\u0107-Mini\u0107","year":"2009","journal-title":"Discrete Optim."},{"key":"10.1016\/j.orl.2017.03.004_br000100","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0166-218X(01)00268-2","article-title":"Domination analysis of some heuristics for the asymmetric traveling salesman problem","volume":"119","author":"Punnen","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2017.03.004_br000105","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00453-002-0986-1","article-title":"TSP heuristics: domination analysis and complexity","volume":"35","author":"Punnen","year":"2003","journal-title":"Algorithmica"},{"key":"10.1016\/j.orl.2017.03.004_br000110","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tcs.2014.11.008","article-title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms","volume":"565","author":"Punnen","year":"2015","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.orl.2017.03.004_br000115","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.ejor.2015.10.006","article-title":"The bipartite quadratic assignment program and extensions","volume":"250","author":"Punnen","year":"2016","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.orl.2017.03.004_br000120","first-page":"18","article-title":"Estimates of the accuracy of procedures in the traveling salesman problem","volume":"4","author":"Rublineckii","year":"1973","journal-title":"Numer. Math. Comput. Technol."},{"key":"10.1016\/j.orl.2017.03.004_br000125","first-page":"51","article-title":"The mean value of the functional in sampling problems","volume":"139","author":"Sarvanov","year":"1978","journal-title":"Vestsi Akad. Navuk BSSR Ser. Fiz.-Matematych. Navuk"},{"key":"10.1016\/j.orl.2017.03.004_br000130","first-page":"8","article-title":"The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of exponential cardinality in quadratic time","volume":"31","author":"Sarvanov","year":"1981","journal-title":"Softw.: Algorithms Programs"},{"key":"10.1016\/j.orl.2017.03.004_br000135","first-page":"11","article-title":"The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of factorial cardinality in cubic time","volume":"31","author":"Sarvanov","year":"1981","journal-title":"Softw.: Algorithms Programs"},{"key":"10.1016\/j.orl.2017.03.004_br000140","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/j.disopt.2007.11.009","article-title":"Dominance guarantees for above-average solutions","volume":"5","author":"Twitto","year":"2008","journal-title":"Discrete Optim."},{"key":"10.1016\/j.orl.2017.03.004_br000145","first-page":"76","article-title":"Values of the target functional in a priority problem that are majorized by the mean value","author":"Vizing","year":"1973","journal-title":"Kibernetika"},{"key":"10.1016\/j.orl.2017.03.004_br000150","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/moor.6.3.319","article-title":"Measuring the quality of approximate solutions to zero\u2013one programming problems","volume":"6","author":"Zemel","year":"1981","journal-title":"Math. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637717301517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637717301517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T17:39:58Z","timestamp":1565372398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637717301517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["S0167637717301517"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2017.03.004","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2017.03.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
