{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:29Z","timestamp":1725491789423},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755135"},{"type":"electronic","value":"9783540755142"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75514-2_10","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T06:34:24Z","timestamp":1190183664000},"page":"123-139","source":"Crossref","is-referenced-by-count":3,"title":["Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Data structures and algorithms","author":"A. Aho","year":"1983","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: Data structures and algorithms. Addison-Wesley, Reading (1983)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C.: Beam-ACO\u2013hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers and Operations Research\u00a032, 1565\u20131591 (2005)","journal-title":"Computers and Operations Research"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-45724-0_2","volume-title":"ANTS 2002","author":"C. Blum","year":"2002","unstructured":"Blum, C., Bautista, J., Pereira, J.: Beam-ACO applied to assembly line balancing. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol.\u00a02463, pp. 14\u201327. Springer, Heidelberg (2002)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-71615-0_4","volume-title":"EvoCOP 2007","author":"C. Blum","year":"2007","unstructured":"Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E.: A probabilistic beam search algorithm for the shortest common supersequence problem. In: Cotta, C., van Hemert, J.I. (eds.) EvoCOP 2007. LNCS, vol.\u00a04446, pp. 36\u201347. Springer, Berlin (2007)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics \u2013 Part B\u00a034(2), 1161\u20131172 (2004)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics \u2013 Part B"},{"key":"10_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"10_CR8","unstructured":"Fraser, C.B.: Subsequences and supersequences of strings. PhD thesis, University of Glasgow (1995)"},{"key":"10_CR9","volume-title":"Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. In: Computer Science and Computational Biology, Cambridge University Press, Cambridge (1997)"},{"key":"10_CR10","first-page":"1006","volume-title":"Proceedings of the International Computer Symposium","author":"K. Huang","year":"2004","unstructured":"Huang, K., Yang, C., Tseng, K.: Fast algorithms for finding the common subsequences of multiple sequences. In: Proceedings of the International Computer Symposium, pp. 1006\u20131011. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM\u00a025, 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V.: Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem. INFORMS Journal on Computing\u00a011(4), 358\u2013369 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V. Maniezzo","year":"2000","unstructured":"Maniezzo, V., Carbonaro, A.: An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems\u00a016, 927\u2013935 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45724-0_19","volume-title":"Ant Algorithms","author":"V. Maniezzo","year":"2002","unstructured":"Maniezzo, V., Milandri, M.: An ant-based framework for very strongly constrained problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms. LNCS, vol.\u00a02463, pp. 222\u2013227. Springer, Heidelberg (2002)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/00207548808947840","volume":"26","author":"P.S. Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. International Journal of Production Research\u00a026, 297\u2013307 (1988)","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75514-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:25:20Z","timestamp":1558261520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755135","9783540755142"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}