Algorithms for the workflow satisfiability problem engineered for counting constraints
From MaRDI portal
Publication:328681
DOI10.1007/s10878-015-9877-7zbMath1354.90105arXiv1504.02420MaRDI QIDQ328681
Publication date: 20 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02420
algorithm engineering; fixed-parameter tractability (FPT); reduction to the pseudo-Boolean SAT problem; user-independent constraints; workflow satisfiability problem (WSP)
90C27: Combinatorial optimization
Uses Software