{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:09:06Z","timestamp":1725822546159},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662435045"},{"type":"electronic","value":"9783662435052"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-43505-2_64","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T20:47:54Z","timestamp":1432846074000},"page":"1255-1270","source":"Crossref","is-referenced-by-count":3,"title":["Metaheuristic Algorithms and Tree Decomposition"],"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"}]},{"given":"Werner","family":"Schafhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson, P.D. Seymour: Graph minors II: Algorithmic aspects of tree-width, J.\u00a0Algorithms 7, 309\u2013322 (1986)","journal-title":"J.\u00a0Algorithms"},{"key":"64_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil, A. Proskurowski: Complexity of finding embeddings in a\u00a0k-tree, SIAM J.\u00a0Algebr. Discrete Methods 8, 277\u2013284 (1987)","journal-title":"SIAM J.\u00a0Algebr. Discrete Methods"},{"key":"64_CR3","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland: Adaptation in Natural and Artificial Systems (Univ. of Michigan Press, Ann Arbor 1975)"},{"issue":"4598","key":"64_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelaff, M.P. Vecchi: Optimization by simmulated annealing, Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"64_CR5","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F. Glover","year":"1986","unstructured":"F. Glover: Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 5, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"64_CR6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of Metaheuristics","author":"H. Louren\u00e7o","year":"2003","unstructured":"H. Louren\u00e7o, O. Martin, T. St\u00fctzle: Iterated local search. In: Handbook of Metaheuristics, Vol. 57, ed. by F. Glover, G.A. Kochenberger (Springer, New York 2003) pp. 320\u2013353"},{"key":"64_CR7","series-title":"Ph.D. Thesis","volume-title":"Optimization, Learning and Natural Algorithms","author":"M. Dorigo","year":"1992","unstructured":"M. Dorigo: Optimization, Learning and Natural Algorithms, Ph.D. Thesis (Dipartimento di Elettronica, Politecnico di Milano, Italy 1992), in Italian"},{"issue":"1","key":"64_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo, A. Colorni: The ant system: Optimization by a\u00a0colony of cooperating agents, IEEE Trans. Syst. Man Cybern. B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"key":"64_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. Lauritzen","year":"1988","unstructured":"S. Lauritzen, D. Spiegelhalter: Local computations with probabilities on graphical structures and their application to expert systems, J.\u00a0R. Stat. Soc. Ser. B 50, 157\u2013224 (1988)","journal-title":"J.\u00a0R. Stat. Soc. Ser. B"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-46784-X_32","volume":"1665","author":"A.M. Koster","year":"1999","unstructured":"A.M. Koster, S.P. van Hoesel, A.W. Kolen: Optimal solutions for frequency assignment problems via tree decomposition, Lect. Notes Comput. Sci. 1665, 338\u2013350 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"key":"64_CR11","first-page":"210","volume":"145","author":"J. Alber","year":"2004","unstructured":"J. Alber, F. Dorn, R. Niedermeier: Experimental evaluation of a\u00a0tree decomposition based algorithm for vertex cover on planar graphs, Discrete Appl. Math. 145, 210\u2013219 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"64_CR12","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.10046","volume":"40","author":"A. Koster","year":"2002","unstructured":"A. Koster, S. van Hoesel, A. Kolen: Solving partial constraint satisfaction problems with tree-decomposition, Networks 40(3), 170\u2013180 (2002)","journal-title":"Networks"},{"key":"64_CR13","first-page":"247","volume-title":"Proc. IEEE Comput. Syst. Bioinform. Conf.","author":"J. Xu","year":"2005","unstructured":"J. Xu, F. Jiao, B. Berger: A\u00a0tree-decomposition approach to protein structure prediction, Proc. IEEE Comput. Syst. Bioinform. Conf. (2005) pp. 247\u2013256"},{"key":"64_CR14","volume-title":"Proc. Learn. Intell. Optim. Conf. (LION 6)","author":"M. Morak","year":"2012","unstructured":"M. Morak, N. Musliu, R. Pichler, S. R\u00fcmmele, S. Woltran: Evaluating tree-decomposition based algorithms for answer set programming, Proc. Learn. Intell. Optim. Conf. (LION 6) (2012)"},{"key":"64_CR15","volume-title":"Treewidth: Computational Experiments, Electronic Notes in Discrete Mathematics","author":"A. Koster","year":"2001","unstructured":"A. Koster, H. Bodlaender, S. van Hoesel: Treewidth: Computational Experiments, Electronic Notes in Discrete Mathematics, Vol. 8 (Elsevier Science, Amsterdam 2001)"},{"key":"64_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1051\/ro:2004011","volume":"38","author":"F. Clautiaux","year":"2004","unstructured":"F. Clautiaux, A. Moukrim, S. N\u00e9gre, J. Carlier: Heuristic and meta-heurisistic methods for computing graph treewidth, RAIRO Oper. Res. 38, 13\u201326 (2004)","journal-title":"RAIRO Oper. Res."},{"key":"64_CR17","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"D.R. Fulkerson, O. Gross: Incidence matrices and interval graphs, Pac. J.\u00a0Math. 15, 835\u2013855 (1965)","journal-title":"Pac. J.\u00a0Math."},{"key":"64_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril: Algorithms for minimum coloring, maximum clique, minimum coloring cliques and maximum independent set of a\u00a0chordal graph, SIAM J.\u00a0Comput. 1, 180\u2013187 (1972)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"1","key":"64_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1018553211613","volume":"7","author":"P. Larranaga","year":"1997","unstructured":"P. Larranaga, C. Kuijpers, M. Poza, R. Murga: Decomposing Bayesian networks: Triangulation of the moral graph with genetic algorithms, Stat. Comput. 7(1), 19\u201334 (1997)","journal-title":"Stat. Comput."},{"issue":"3","key":"64_CR20","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1504\/EJIE.2007.014690","volume":"1","author":"N. Musliu","year":"2007","unstructured":"N. Musliu, W. Schafhauser: Genetic algorithms for generalized hypertree decompositions, Eur. J.\u00a0Ind. Eng. 1(3), 317\u2013340 (2007)","journal-title":"Eur. J.\u00a0Ind. Eng."},{"key":"64_CR21","first-page":"95","volume-title":"EvoCOP","author":"T. Hammerl","year":"2010","unstructured":"T. Hammerl, N. Musliu: Ant colony optimization for tree decompositions. In: EvoCOP, ed. by P. Cowling, P. Merz (Springer, Berlin, Heidelberg 2010) pp. 95\u2013106"},{"issue":"1","key":"64_CR22","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01890544","volume":"2","author":"U. Kjaerulff","year":"1992","unstructured":"U. Kjaerulff: Optimal decomposition of probabilistic networks by simulated annealing, Stat. Comput. 2(1), 2\u201317 (1992)","journal-title":"Stat. Comput."},{"key":"64_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-70807-0_9","volume-title":"Studies in Computational Intelligence, Recent Advances in Evolutionary Computation for Combinatorial Optimization","author":"N. Musliu","year":"2008","unstructured":"N. Musliu: An iterative heuristic algorithm for tree decomposition. In: Studies in Computational Intelligence, Recent Advances in Evolutionary Computation for Combinatorial Optimization, Vol. 153, ed. by C. Cotta, J.I. van Hemert (Springer, Berlin, Heidelberg 2008) pp. 133\u2013150"},{"key":"64_CR24","series-title":"Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/012","volume-title":"The Second Dimacs Implementation Challenge: NP-Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability","author":"D.S. Johnson","year":"1993","unstructured":"D.S. Johnson, M.A. Trick: The Second Dimacs Implementation Challenge: NP-Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability, Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, Boston 1993)"},{"key":"64_CR25","series-title":"M.S. Thesis","volume-title":"Ant Colony Optimization for Tree and Hypertree Decompositions","author":"T. Hammerl","year":"2009","unstructured":"T. Hammerl: Ant Colony Optimization for Tree and Hypertree Decompositions, M.S. Thesis (Vienna University of Technology, Vienna 2009)"},{"key":"64_CR26","series-title":"A\u00a0Bradford Book","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"M. Dorigo, T. St\u00fctzle: Ant Colony Optimization, A\u00a0Bradford Book (MIT Press, Cambridge 2004)"},{"issue":"1","key":"64_CR27","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"B. Bullnheimer, R.F. Hartl, C. Strauss: A\u00a0new rank based version of the ant system: A\u00a0computational study, Cent. Eur. J.\u00a0Oper. Res. Econ. 7(1), 25\u201338 (1999)","journal-title":"Cent. Eur. J.\u00a0Oper. Res. Econ."},{"key":"64_CR28","first-page":"309","volume-title":"IEEE Int. Conf. Evol. Comput.","author":"T. St\u00fctzle","year":"1997","unstructured":"T. St\u00fctzle, H. Hoos: Max-min ant system and local search for the traveling salesman problem, IEEE Int. Conf. Evol. Comput. (1997) pp. 309\u2013314"},{"issue":"9","key":"64_CR29","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle, H. Hoos: Max-min ant system, Future Gener. Comput. Syst. 16(9), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"64_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo, L.M. Gambardella: Ant colony system: A\u00a0cooperative learning approach to the traveling salesman problem, IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"64_CR31","first-page":"130","volume-title":"EvoCOP","author":"N. Musliu","year":"2007","unstructured":"N. Musliu: Generation of tree decompositions by iterated local search. In: EvoCOP, ed. by C. Cotta, J. van Hemert (Springer, Berlin, Heidelberg 2007) pp. 130\u2013141"},{"key":"64_CR32","first-page":"185","volume-title":"Proc. Natl. Conf. Artif. Intell. (AAAI'97)","author":"K. Shoikhet","year":"1997","unstructured":"K. Shoikhet, D. Geiger: A\u00a0practical algorithm for finding optimal triangulations, Proc. Natl. Conf. Artif. Intell. (AAAI'97) (1997) pp. 185\u2013190"},{"key":"64_CR33","first-page":"201","volume-title":"Proc. 20th Annu. Conf. Uncertain. Artif. Intell. UAI-04","author":"V. Gogate","year":"2004","unstructured":"V. Gogate, R. Dechter: A\u00a0complete anytime algorithm for treewidth, Proc. 20th Annu. Conf. Uncertain. Artif. Intell. UAI-04 (2004) pp. 201\u2013208"},{"key":"64_CR34","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/11775096_24","volume":"4041","author":"E. Bachoore","year":"2006","unstructured":"E. Bachoore, H. Bodlaender: A\u00a0branch and bound algorithm for exact, upper, and lower bounds on treewidth, Lect. Notes Comput. Sci. 4041, 255\u2013266 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"64_CR35","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"R. Tarjan, M. Yannakakis: Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J.\u00a0Comput. 13, 566\u2013579 (1984)","journal-title":"SIAM J.\u00a0Comput."},{"key":"64_CR36","first-page":"54","volume-title":"Proc. Natl. Conf. Artif. Intell. (AAAI)","author":"K. Kask","year":"2011","unstructured":"K. Kask, A. Gelfand, L. Otten, R. Dechter: Pushing the power of stochastic greedy ordering schemes for inference in graphical models, Proc. Natl. Conf. Artif. Intell. (AAAI) (2011) pp. 54\u201360"},{"issue":"3","key":"64_CR37","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"H.L. Bodlaender","year":"2010","unstructured":"H.L. Bodlaender, A.M.C.A. Koster: Treewidth computations I. Upper bounds, Inf. Comput. 208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"issue":"1","key":"64_CR38","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cor.2010.07.009","volume":"39","author":"A. Khanafer","year":"2012","unstructured":"A. Khanafer, F. Clautiaux, E.-G. Talbi: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Comput. Oper. Res. 39(1), 54\u201363 (2012)","journal-title":"Comput. Oper. Res."},{"key":"64_CR39","first-page":"505","volume-title":"23rd IEEE Int. Conf. Tools Artif. Intell. (ICTAI)","author":"M. Fontaine","year":"2011","unstructured":"M. Fontaine, S. Loudni, P. Boizumault: Guiding VNS with tree decomposition, 23rd IEEE Int. Conf. Tools Artif. Intell. (ICTAI) (IEEE, Boca Raton 2011) pp. 505\u2013512"}],"container-title":["Springer Handbook of Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43505-2_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T07:38:42Z","timestamp":1717918722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43505-2_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662435045","9783662435052"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43505-2_64","relation":{},"subject":[],"published":{"date-parts":[[2015]]}}}