{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:16:07Z","timestamp":1761488167042},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926948"},{"type":"electronic","value":"9783540926955"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_2","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:11:59Z","timestamp":1229422319000},"page":"12-24","source":"Crossref","is-referenced-by-count":4,"title":["An Adaptive Memory-Based Approach Based on Partial Enumeration"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Bartolini","sequence":"first","affiliation":[]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"Barahona, F.: Network design using cut inequalities. SIAM Journal on Optimization\u00a06(3), 823\u2013837 (1996)","journal-title":"SIAM Journal on Optimization"},{"key":"2_CR2","unstructured":"Bartolini, E., Mingozzi, A.: Algorithms for the non-bifurcated capacitated network design problem. Report, Computer Science, Univ. of Bologna (2006)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C. Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The pilot method: A strategy for heurisic repetition with application problem in graphs. Networks\u00a034, 181\u2013191 (1999)","journal-title":"Networks"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I. Ghamlouche","year":"2003","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design. Operations Rsearch\u00a051(4), 655\u2013667 (2003)","journal-title":"Operations Rsearch"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BFb0026589","volume-title":"Artificial Evolution","author":"F. Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol.\u00a01363, pp. 3\u201351. Springer, Heidelberg (1998)"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Boston (1997)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"2590","DOI":"10.1016\/j.cor.2005.07.006","volume":"33","author":"P. Greistorfer","year":"2006","unstructured":"Greistorfer, P., Rego, C.: a simple filter-and-fan approach to the facility location problem. Computers & Operations Research\u00a033, 2590\u20132601 (2006)","journal-title":"Computers & Operations Research"},{"issue":"7","key":"2_CR8","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1057\/jors.1993.115","volume":"44","author":"I. Kousik","year":"1993","unstructured":"Kousik, I., Ghosh, D., Murthy, I.: A heuristic procedure for leasing channels in telecommunications networks. The Journal of The Operational Research Society\u00a044(7), 659\u2013672 (1993)","journal-title":"The Journal of The Operational Research Society"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Operations Research\u00a043, 142\u2013157 (1995)","journal-title":"Operations Research"},{"issue":"4","key":"2_CR10","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 J. on Computing\u00a011(4), 358\u2013369 (1999)","journal-title":"INFORMS J. on Computing"},{"key":"2_CR11","first-page":"222","volume-title":"ANTS 2002: Proceedings of the Third International Workshop on Ant Algorithms","author":"V. Maniezzo","year":"2002","unstructured":"Maniezzo, V., Milandri, M.: An ant-based framework for very strongly constrained problems. In: ANTS 2002: Proceedings of the Third International Workshop on Ant Algorithms, pp. 222\u2013227. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T13:47:45Z","timestamp":1551707265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}