Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP

David Allouche, Simon de Givry, George Katsirelos, Thomas Schiex, Matthias Zytnicki. Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP. In Gilles Pesant, editor, Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings. Volume 9255 of Lecture Notes in Computer Science, pages 12-29, Springer, 2015. [doi]

@inproceedings{AlloucheGKSZ15,
  title = {Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP},
  author = {David Allouche and Simon de Givry and George Katsirelos and Thomas Schiex and Matthias Zytnicki},
  year = {2015},
  doi = {10.1007/978-3-319-23219-5_2},
  url = {http://dx.doi.org/10.1007/978-3-319-23219-5_2},
  researchr = {https://researchr.org/publication/AlloucheGKSZ15},
  cites = {0},
  citedby = {0},
  pages = {12-29},
  booktitle = {Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings},
  editor = {Gilles Pesant},
  volume = {9255},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-23218-8},
}