{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:19:44Z","timestamp":1740028784664,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121388"},{"type":"electronic","value":"9783642121395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_9","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"95-106","source":"Crossref","is-referenced-by-count":3,"title":["Ant Colony Optimization for Tree Decompositions"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hammerl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank Based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics\u00a07(1), 25\u201338 (1999)","journal-title":"Central European Journal for Operations Research and Economics"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1051\/ro:2004011","volume":"38","author":"F. Clautiaux","year":"2004","unstructured":"Clautiaux, F., Moukrim, A., N\u00e9gre, S., Carlier, J.: Heuristic and meta-heurisistic methods for computing graph treewidth. RAIRO Oper. Res.\u00a038, 13\u201326 (2004)","journal-title":"RAIRO Oper. Res."},{"key":"9_CR3","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms [in Italian]. PhD thesis, Dipartimento die Elettronica, Politecnico di Milano, Milan (1992)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Book (2004) ISBN 0262042193","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a026, 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"9_CR7","unstructured":"Gogate, V., Dechter, R.: A complete anytime algorithm for treewidth. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 201\u2013208 (2004)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Hammerl, T.: Ant Colony Optimization for Tree and Hypertree Decompositions. Master\u2019s Thesis, Vienna University of Technology (2009)","DOI":"10.1007\/978-3-642-12139-5_9"},{"key":"9_CR9","first-page":"2","volume":"1","author":"U. Kjaerulff","year":"1992","unstructured":"Kjaerulff, U.: Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing\u00a01, 2\u201317 (1992)","journal-title":"Statistics and Computing"},{"key":"9_CR10","series-title":"Electronic Notes in Discrete Mathematics","volume-title":"Treewidth: Computational experiments.","author":"A. Koster","year":"2001","unstructured":"Koster, A., Bodlaender, H., van Hoesel, S.: Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics, vol.\u00a08. Elsevier Science Publishers, Amsterdam (2001)"},{"issue":"1","key":"9_CR11","first-page":"1997","volume":"7","author":"P. Larranaga","year":"1991","unstructured":"Larranaga, P., Kujipers, C.M.H., Poza, M., Murga, R.H.: Decomposing bayesian networks: triangulation of the moral graph with genetic algorithms. Statistics and Computing (UK)\u00a07(1), 1997 (1991)","journal-title":"Statistics and Computing (UK)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Musliu, N.: An iterative heuristic algorithm for tree decomposition. In: Cotta, C., van Hemert, J. (eds.) Recent Advances in Evolutionary Computation for Combinatorial Optimization, vol.\u00a0153, pp. 133\u2013150 (2008)","DOI":"10.1007\/978-3-540-70807-0_9"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1504\/EJIE.2007.014690","volume":"1","author":"N. Musliu","year":"2007","unstructured":"Musliu, N., Schafhauser, W.: Genetic algorithms for generalised hypertree decompositions. European Journal of Industrial Engineering\u00a01(3), 317\u2013340 (2007)","journal-title":"European Journal of Industrial Engineering"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. Journal Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal Algorithms"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min Ant System and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, pp. 309\u2013314 (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"9","key":"9_CR16","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min Ant System. Future Gener. Comput. Syst.\u00a016(9), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput.\u00a013, 566\u2013579 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T20:06:39Z","timestamp":1739995599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}