Solving partial constraint satisfaction problems with tree decomposition
From MaRDI portal
Publication:4785233
DOI10.1002/net.10046zbMath1027.90072MaRDI QIDQ4785233
Arie M. C. A. Koster, Stan P. M. 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
dynamic programming; satisfaction; tree decomposition; frequency assignment; MAX-SAT; partial constraint
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
90C39: Dynamic programming
90B80: Discrete location and assignment
Uses Software