{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:17Z","timestamp":1725559157049},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_32","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"437-451","source":"Crossref","is-referenced-by-count":6,"title":["Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems"],"prefix":"10.1007","author":[{"given":"Agustin","family":"Bompadre","sequence":"first","affiliation":[]},{"given":"James B.","family":"Orlin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123, 75\u2013102 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BF01934085","volume":"28","author":"F. Aurenhammer","year":"1998","unstructured":"Aurenhammer, F.: On-line sorting of twisted sequences in linear time. BIT\u00a028, 194\u2013204 (1998)","journal-title":"BIT"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1023\/A:1018939709890","volume":"86","author":"E. Balas","year":"1996","unstructured":"Balas, E.: New classes of efficiently solvable generalized traveling salesman problem. Annals of Operations Research\u00a086, 529\u2013558 (1996)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","volume":"13","author":"E. Balas","year":"2001","unstructured":"Balas, E., Simonetti, N.: Linear Time Dynamic Programming Algorithms for New Classes of Restricted TSPs: A Computational Study. INFORMS Journal on Computing\u00a013(1), 56\u201375 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: STOC 1994: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/S0036144596297514","volume":"40","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., Deineko, V.G., van Dal, R., van der Veen, J.A.A., Woeginger, G.J.: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Review\u00a040(3), 496\u2013546 (1998)","journal-title":"SIAM Review"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1287\/moor.23.3.613","volume":"23","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., Deineko, V.G., Woeginger, G.J.: The traveling salesman probem and the PQ-tree. Mathematics of Operations Research\u00a023, 613\u2013623 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"32_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1051\/ro\/1990240302451","volume":"24","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., Villon, P.: A new heuristic for the traveling salesman problem. RAIRO - Oper. Res.\u00a024, 245\u2013253 (1990)","journal-title":"RAIRO - Oper. Res."},{"key":"32_CR10","unstructured":"Congram, R.K.: Polynomially searchable exponential neighborhoods for sequencing problems in combinatorial optimisation. Ph.D. thesis, University of Southampton, UK (2000)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R.K. Congram","year":"2002","unstructured":"Congram, R.K., Potts, C.N., van de Velde, S.L.: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. INFORMS Journal on Computing\u00a014, 52\u201367 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"32_CR12","first-page":"519","volume":"Ser. A 78","author":"V.G. Deineko","year":"2000","unstructured":"Deineko, V.G., Woeginger, G.J.: A study of exponential neighborhoods for the Traveling Salesman Problem and for the Quadratic Assignment Problem. Mathematical Programming\u00a0Ser. A 78, 519\u2013542 (2000)","journal-title":"Mathematical Programming"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Ergun, \u00d6., Orlin, J.B.: Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem. MIT Sloan Working Paper No. 4463-03 (2003)","DOI":"10.2139\/ssrn.489784"},{"key":"32_CR14","volume-title":"Well solved special cases, ch. 4","author":"P.C. Gilmore","year":"1985","unstructured":"Gilmore, P.C., Lawler, E.L., Schmoys, D.B.: The traveling salesman problem. In: Well solved special cases, ch. 4. John Wiley, Chichester (1985)"},{"key":"32_CR15","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Reading (1979)"},{"key":"32_CR16","unstructured":"Klyaus, P.S.: The structure of the optimal solution of certain classes of traveling salesman problems. Vestsi Akad. Nauk BSSR, Phys. Math. Sci., Minsk, 95\u201398 (1976) (in Russian)"},{"key":"32_CR17","unstructured":"Potts, C.N., van de Velde, S.L.: Dynasearch\u2013Iterative local improvement by dynamic programming. Part I. The traveling salesman problem, Technical Report, University of Twente, The Netherlands (1995)"},{"key":"32_CR18","unstructured":"Sarvanov, V.I., Doroshko, N.N.: The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of exponential cardinality in quadratic time. Software: Algorithms and Programs 31, Mathematical Institute of the Belorrusian Academy of Sciences, Minsk, 8\u201311 (1981) (in Russian)"},{"issue":"4","key":"32_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM (JACM)\u00a027(4), 701\u2013717 (1980)","journal-title":"Journal of the ACM (JACM)"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44629-X_2","volume-title":"Practice and Theory of Automated Timetabling III","author":"H.M.M. Eikelder ten","year":"2001","unstructured":"ten Eikelder, H.M.M., Willemen, R.J.: Some Complexity Aspects of Secondary School Timetabling Problems. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 18\u201327. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:34Z","timestamp":1605643234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11496915_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}