Solving partial constraint satisfaction problems with tree decomposition
DOI10.1002/NET.10046zbMATH Open1027.90072OpenAlexW2080959483MaRDI QIDQ4785233FDOQ4785233
Authors: Arie M. C. A. Koster, Stan Van Hoesel, Antoon W. J. Kolen 
Publication date: 17 December 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/b7af3f17-3aec-4858-a7fc-592a49b9343e
Recommendations
- Publication:3489491
- Solving frequency assignment problems via tree-decomposition
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
- A comparison of structural CSP decomposition methods
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
Cited In (19)
- D-FLAT: declarative problem solving using tree decompositions and answer-set programming
- Title not available (Why is that?)
- A comparison of problem decomposition techniques for the FAP
- Tree decomposition and discrete optimization problems: a survey
- Safe separators for treewidth
- A \(c^k n\) 5-approximation algorithm for treewidth
- A branch-and-price-and-cut method for computing an optimal bramble
- On the maximum cardinality search lower bound for treewidth
- Generalized partial computation using disunification to solve constraints
- Tangle bases: Revisited
- Tree decompositions of graphs: saving memory in dynamic programming
- Treewidth computations. I: Upper bounds
- Models and solution techniques for frequency assignment problems
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
- Tree decompositions and social graphs
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem
- Fixed-parameter tractability of treewidth and pathwidth
Uses Software
This page was built for publication: Solving partial constraint satisfaction problems with tree decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785233)
