{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T21:09:28Z","timestamp":1710364168975},"reference-count":32,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100004807","name":"German Research Foundation (DFG)","doi-asserted-by":"publisher","award":["BU 2313\/2"],"id":[{"id":"10.13039\/100004807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1016\/j.ejor.2016.03.031","type":"journal-article","created":{"date-parts":[[2016,3,25]],"date-time":"2016-03-25T03:17:02Z","timestamp":1458875822000},"page":"584-592","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Lower bounding procedure for the asymmetric quadratic traveling salesman problem"],"prefix":"10.1016","volume":"253","author":[{"given":"Borzou","family":"Rostami","sequence":"first","affiliation":[]},{"given":"Federico","family":"Malucelli","sequence":"additional","affiliation":[]},{"given":"Pietro","family":"Belotti","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejor.2016.03.031_bib0001","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","article-title":"A level-2 reformulation-linearization technique bound for the quadratic assignment problem","volume":"180","author":"Adams","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2016.03.031_bib0002","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/dimacs\/016\/02","article-title":"Improved linear programming-based lower bounds for the quadratic assignment problem","volume":"16","author":"Adams","year":"1994","journal-title":"DIMACS series in discrete mathematics and theoretical computer science"},{"issue":"10","key":"10.1016\/j.ejor.2016.03.031_bib0003","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","article-title":"A tight linearization and an algorithm for zero-one quadratic programming problems","volume":"32","author":"Adams","year":"1986","journal-title":"Management Science"},{"issue":"2","key":"10.1016\/j.ejor.2016.03.031_bib0004","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","article-title":"Linearization strategies for a class of zero-one mixed integer programming problems","volume":"38","author":"Adams","year":"1990","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2016.03.031_bib0005","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S0097539796312721","article-title":"The angular-metric traveling salesman problem","volume":"29","author":"Aggarwal","year":"2000","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2016.03.031_bib0006","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1002\/net.20423","article-title":"On minimum reload cost paths, tours, and flows","volume":"57","author":"Amaldi","year":"2011","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ejor.2016.03.031_bib0007","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations research"},{"issue":"4","key":"10.1016\/j.ejor.2016.03.031_bib0008","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Journal of the Operations Research Society of America"},{"issue":"5","key":"10.1016\/j.ejor.2016.03.031_bib0009","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","article-title":"LEMON - an open source C++ graph template library","volume":"264","author":"Dezs","year":"2011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ejor.2016.03.031_bib0010","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"Du Merle","year":"1999","journal-title":"Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2016.03.031_bib0011","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/110858665","article-title":"An analysis of the asymmetric quadratic traveling salesman polytope","volume":"28","author":"Fischer","year":"2014","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.ejor.2016.03.031_bib0012","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.dam.2013.09.011","article-title":"Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics","volume":"166","author":"Fischer","year":"2014","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2016.03.031_bib0013","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10107-012-0568-1","article-title":"The symmetric quadratic traveling salesman problem","volume":"142","author":"Fischer","year":"2013","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2016.03.031_bib0014","series-title":"AMPL: a mathematical programming language","author":"Fourer","year":"1987"},{"issue":"0","key":"10.1016\/j.ejor.2016.03.031_bib0015","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.dam.2011.12.006","article-title":"On minimum reload cost cycle cover","volume":"164, Part 1","author":"Galbiati","year":"2014","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"10.1016\/j.ejor.2016.03.031_bib0016","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting-stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Operations research"},{"issue":"1","key":"10.1016\/j.ejor.2016.03.031_bib0017","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","article-title":"Technical note\u2013converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program","volume":"22","author":"Glover","year":"1974","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2016.03.031_bib0018","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","article-title":"Lower bounds for the quadratic assignment problem based upon a dual formulation","volume":"46","author":"Hahn","year":"1998","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2016.03.031_bib0019","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2016.03.031_bib0020","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2016.03.031_bib0021","series-title":"Combinatorial optimization and applications","first-page":"211","article-title":"Algorithms and experimental study for the traveling salesman problem of second order","author":"J\u00e4ger","year":"2008"},{"issue":"5","key":"10.1016\/j.ejor.2016.03.031_bib0022","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","article-title":"Lagrangian duality applied to the vehicle routing problem with time windows","volume":"33","author":"Kallehauge","year":"2006","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2016.03.031_bib0023","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ejor.2012.01.011","article-title":"Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem","volume":"219","author":"Karapetyan","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2016.03.031_bib0024","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01592242","article-title":"A descent method with linear programming subproblems for nondifferentiable convex optimization","volume":"71","author":"Kim","year":"1995","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/j.ejor.2016.03.031_bib0025","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","article-title":"The BOXSTEP method for large-scale optimization","volume":"23","author":"Marsten","year":"1975","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2016.03.031_bib0026","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"J. ACM"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2016.03.031_bib0027","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The boolean quadric polytope: some characteristics, facets and relatives","volume":"45","author":"Padberg","year":"1989","journal-title":"Mathematical Programming"},{"issue":"1-3","key":"10.1016\/j.ejor.2016.03.031_bib0028","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","article-title":"An analytical comparison of different formulations of the travelling salesman problem","volume":"52","author":"Padberg","year":"1991","journal-title":"Mathematical Programming"},{"issue":"0","key":"10.1016\/j.ejor.2016.03.031_bib0029","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.disopt.2014.08.003","article-title":"A revised reformulation-linearization technique for the quadratic assignment problem","volume":"14","author":"Rostami","year":"2014","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.ejor.2016.03.031_bib0030","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.cor.2015.06.005","article-title":"Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation","volume":"64","author":"Rostami","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2016.03.031_bib0031","series-title":"Computer science and information systems (fedcsis)federated conference on","first-page":"377","article-title":"Quadratic TSP: a lower bounding procedure and a column generation approach","author":"Rostami","year":"2013"},{"issue":"4","key":"10.1016\/j.ejor.2016.03.031_bib0032","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1287\/opre.50.4.656.2865","article-title":"On tightening the relaxations of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problems","volume":"50","author":"Sherali","year":"2002","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171630159X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171630159X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,14]],"date-time":"2018-09-14T02:57:01Z","timestamp":1536893821000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722171630159X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S037722171630159X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2016.03.031","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2016,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Lower bounding procedure for the asymmetric quadratic traveling salesman problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2016.03.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}