Solving Partial Constraint Satisfaction Problems with Tree Decomposition

Networks

Volumn 40, Issue 3, 2002, Pages 170-180

  Koster, Arie M C A ^a   Van Hoesel, Stan P M ^b   Kolen, Antoon W J ^b  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Dynamic programming; Frequency assignment; MAX SAT; Partial constraint satisfaction; Tree decomposition

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DYNAMIC PROGRAMMING; GRAPH THEORY; TREES (MATHEMATICS);

TREE DECOMPOSITION;

CONSTRAINT THEORY;

EID: 0141920466     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10046     Document Type: Article

References (17)

1. K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, and B. Jansen, A branch-and-cut algorithm for the frequency assignment problem, Research Memorandum 96/011, Maastricht University, 1996. Available at http://www-edocs.unimaas.nl/abs/rm96011.htm.
2. K.I. Aardal, C.AJ. Hurkens, J.K. Lenstra, and S.R. Tiourine, Algorithms for radio link frequency assignment: The CALMA project, Oper Res (to appear).
3. K.I. Aardal, C.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino, and A. Sassano, Models and solution techniques for the frequency assignment problem, ZIB-report 01-40, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 2001. Available at http://www.zib.de/PaperWeb/abstracts/ ZR-01-40/.
4. S. Arnborg, D.G. Cornell, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J Alg Discr Methods 8 (1987), 277-284.
5. H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernet 11 (1993), 1-21.
6. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J Comput 25 (1996), 1305-1317.
7. The second DIMACS implementation challenge: NP-hard problems: Maximum clique, graph coloring, and satisfiability; see http://dimacs.rutgers.edu/Challenges/ or http://mat.gsia.cmu.edu/challenge.html, 1992-1993.
8. A. Eisenblätter and A.M.C.A. Koster, FAP web - A website devoted to frequency assignment. URL: http://fap.zib.de, 2000.
9. C. Feremans, Generalized spanning trees and extensions, Ph.D. Thesis, Université Libre de Bruxelles, 2001. Available at http://smg.ulb.ac.be/Theses/Theses.html.
10. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NSP-completeness, Freeman, New York, 1979.
11. C.A.J. Hurkens and S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, Technical Report COSOR 95-34, Eindhoven University of Technology, 1995. Available at ftp://ftp.win.tue.nl/pub/techreports/cosor/.
12. A.W.J. Kolen, A genetic algorithm for frequency assignment, Technical report, Maastricht University, 1999.
13. A.M.C.A. Koster, Frequency assignment - Models and algorithms, Ph.D. Thesis, Maastricht University, 1999. Available at http://www.zib.de/koster/.
14. A.M.C.A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen, The partial constraint satisfaction problem: Facets and lifting theorems, Oper Res Lett 23 (1998), 89-97.
15. A.M.C.A. Koster, C.P.M. van Hoesel, and A.W.J. Kolen, Solving frequency assignment problems via tree-decomposition, Technical Report RM 99/011, Maastricht University, 1999. Available at http://www.zib.de/koster/.
16. M. Padberg, The Boolean quadric polytope: Some characteristics, facets and relatives, Math Program 45 (1989), 139-172.
17. N. Robertson and P.D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J Alg 7 (1986), 309-322.