{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:42:07Z","timestamp":1725896527118},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_2","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T01:58:57Z","timestamp":1349056737000},"page":"16-30","source":"Crossref","is-referenced-by-count":2,"title":["A Learning Optimization Algorithm in Graph Theory"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Caporossi","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Global Optimization. From Theory to Implementation","author":"M. Aouchiche","year":"2006","unstructured":"Aouchiche, M., Bonnefoy, J.-M., Fidahoussen, A., Caporossi, G., Hansen, P., Lacher\u00e9, J., Monhait, A.: Variable neighborhood search for extremal graphs. 14. the autographix\u00a02 system. In: Liberti, L., Maculan, N. (eds.) Global Optimization. From Theory to Implementation. Springer Science, NewYork (2006)"},{"key":"2_CR2","first-page":"129","volume":"148","author":"M. Aouchiche","year":"2001","unstructured":"Aouchiche, M., Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs 8. variations on graffiti 105. Congressus Numerantium\u00a0148, 129\u2013144 (2001)","journal-title":"Congressus Numerantium"},{"key":"2_CR3","volume-title":"Graph Theory and Combinatorial Optimization","author":"S. Belhaiza","year":"2005","unstructured":"Belhaiza, S., Abreu, N.M.M., Hansen, P., Oliveira, C.S.: Variable neighborhood search for extremal graphs. 11. bounds on algebraic connectivity. In: Hertz, A., Avis, D., Marcotte, O. (eds.) Graph Theory and Combinatorial Optimization. Springer, New York (2005)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1021\/ci9801419","volume":"39","author":"G. Caporossi","year":"1999","unstructured":"Caporossi, G., Cvetkovi\u0107, D., Gutman, I., Hansen, P.: Variable neighborhood search for extremal graphs. 2. finding graphs with extremal energy. Journal of Chemical Information and Computer Sciences\u00a039, 984\u2013996 (1999)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"2_CR5","first-page":"10","volume":"37","author":"G. Caporossi","year":"1999","unstructured":"Caporossi, G., Dobrynin, A.A., Gutman, I., Hansen, P.: Trees with palindromic Hosoya polynomials. Graph Theory Notes of New York\u00a037, 10\u201316 (1999)","journal-title":"Graph Theory Notes of New York"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0097-8485(99)00031-5","volume":"23","author":"G. Caporossi","year":"1999","unstructured":"Caporossi, G., Gutman, I., Hansen, P.: Variable neighborhood search for extremal graphs: 4. chemical trees with extremal connectivity index. Computers and Chemistry\u00a023, 469\u2013477 (1999)","journal-title":"Computers and Chemistry"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0097-8485(02)00016-5","volume":"27","author":"G. Caporossi","year":"2003","unstructured":"Caporossi, G., Gutman, I., Hansen, P., Pavlovi\u0107, L.: Graphs with maximum connectivity index. Computational Biology and Chemistry\u00a027, 85\u201390 (2003)","journal-title":"Computational Biology and Chemistry"},{"key":"2_CR8","unstructured":"Caporossi, G., Hansen, P.: Finding Relations in Polynomial Time. In: Proceedings of the XVI International Joint Conference on Artificial Intelligence, pp. 780\u2013785 (1999)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0012-365X(99)00206-X","volume":"212","author":"G. Caporossi","year":"2000","unstructured":"Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs. 1. the autographix system. Discrete Math.\u00a0212, 29\u201344 (2000)","journal-title":"Discrete Math."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0012-365X(03)00311-X","volume":"276","author":"G. Caporossi","year":"2004","unstructured":"Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs. v. three ways to automate finding conjectures. Discrete Math.\u00a0276, 81\u201394 (2004)","journal-title":"Discrete Math."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/03081080108818690","volume":"49","author":"D. Cvetkovi\u0107","year":"2001","unstructured":"Cvetkovi\u0107, D., Simi\u0107, S., Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs. iii. on the largest eigenvalue of color-constrained trees. Linear and Multilinear Algebra\u00a049, 143\u2013160 (2001)","journal-title":"Linear and Multilinear Algebra"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0009-2614(01)00570-X","volume":"342","author":"P.W. Fowler","year":"2001","unstructured":"Fowler, P.W., Hansen, P., Caporossi, G., Soncini, A.: Variable neighborhood search for extremal graph. 7. polyenes with maximum homo-lumo gap. Chemical Physics Letters\u00a0342, 105\u2013112 (2001)","journal-title":"Chemical Physics Letters"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/S0009-2614(99)00472-8","volume":"306","author":"I. Gutman","year":"1999","unstructured":"Gutman, I., Miljkovi\u0107, O., Caporossi, G., Hansen, P.: Alkanes with small and large randi\u0107 connectivity indices. Chemical Physics Letters\u00a0306, 366\u2013372 (1999)","journal-title":"Chemical Physics Letters"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1021\/ci010133j","volume":"43","author":"P. Hansen","year":"2003","unstructured":"Hansen, P., M\u00e9lot, H.: Variable neighborhood search for extremal graphs. 6. analyzing bounds for the connectivity index. Journal of Chemical Information and Computer Sciences\u00a043, 1\u201314 (2003)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"2_CR15","volume-title":"Graphs and Discovery","author":"P. Hansen","year":"2005","unstructured":"Hansen, P., M\u00e9lot, H.: Variable neighborhood search for extremal graphs. 9. bounding the irregularity of a graph. In: Fajtlowicz, S., Fowler, P., Hansen, P., Janowitz, M., Roberts, F. (eds.) Graphs and Discovery. American Mathematical Society, Providence (2005)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. European J. Oper. Res.\u00a0130, 449\u2013467 (2001)","journal-title":"European J. Oper. Res."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res.\u00a024, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"6609","DOI":"10.1021\/ja00856a001","volume":"97","author":"M. Randi\u0107","year":"1975","unstructured":"Randi\u0107, M.: On characterization of molecular branching. Journal of the American Chemical Society\u00a097, 6609\u20136615 (1975)","journal-title":"Journal of the American Chemical Society"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:13:50Z","timestamp":1558300430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_2"}},"subtitle":["Versatile Search for Extremal Graphs Using a Learning Algorithm"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}