{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:31:36Z","timestamp":1757309496865},"reference-count":19,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0166-218x(03)00359-7","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T20:46:14Z","timestamp":1058906774000},"page":"513-520","source":"Crossref","is-referenced-by-count":16,"title":["Domination analysis of combinatorial optimization problems"],"prefix":"10.1016","volume":"129","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alek","family":"Vainshtein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00359-7_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"2000"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB2","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB3","doi-asserted-by":"crossref","unstructured":"D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, A. Zverovitch, Transformations of generalized ATSP into ATSP, Oper. Res. Lett., to appear.","DOI":"10.1016\/S0167-6377(03)00031-2"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB4","unstructured":"D. Berend, S.S. Skiena, Combinatorial dominance guarantees for heuristic algorithms, manuscript, 2002."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB5","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float","volume":"23","author":"Cornuejols","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB6","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","article-title":"The traveling salesman problem","volume":"48","author":"Glover","year":"1997","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB7","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\/S0166-218X(03)00359-7_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0166-218X(01)00195-0","article-title":"Traveling salesman should not be greedy","volume":"117","author":"Gutin","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB9","series-title":"The Traveling Salesman Problem and its Variations","article-title":"Exponential neighborhoods and domination analysis for the TSP","author":"Gutin","year":"2002"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB10","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\/S0166-218X(03)00359-7_BIB11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB12","first-page":"205","article-title":"Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times","volume":"22","author":"Kise","year":"1979","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB13","unstructured":"A.E. Koller, S.D. Noble, Domination analysis of greedy heuristics for the frequency assignment problem, submitted for publication."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB14","doi-asserted-by":"crossref","unstructured":"C. Lund, M. Yannakakis, The approximation of maximum subgraph problems, Proceedings of the 20th International Colloqium on Automata, Languages and Programming, Lecture Notes in Computer Science Vol. 700, Springer, Berlin, 1993, pp. 40\u201351.","DOI":"10.1007\/3-540-56939-1_60"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00453-002-0986-1","article-title":"TSP heuristics","volume":"35","author":"Punnen","year":"2003","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(03)00359-7_BIB16","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\/S0166-218X(03)00359-7_BIB17","unstructured":"V.I. Rublineckii, Estimates of the accuracy of procedures in the traveling selesman problem, Numer. Math. Comput. Technol. (4) (1973) 18\u201323 (in Russian)."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB18","unstructured":"V.I. Sarvanov, On the minimization of a linear form on a set of all n-elements cycles, Vestsi Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk (4) (1976) 17\u201321 (in Russian)."},{"key":"10.1016\/S0166-218X(03)00359-7_BIB19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/moor.6.3.319","article-title":"Measuring the quality of approximate solutions to zero-one programming problems","volume":"6","author":"Zemel","year":"1981","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003597?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003597?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T10:55:22Z","timestamp":1552820122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X03003597"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00359-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}