Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
From MaRDI portal
Publication:1685966
DOI10.1016/J.TCS.2017.09.036zbMath1382.68115OpenAlexW2760875619MaRDI QIDQ1685966
Publication date: 20 December 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.036
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Curriculum-based course timetabling with SAT and MaxSAT
- Cardinality networks: a theoretical and empirical study
- An efficient multiway merging algorithm
- Encoding cardinality constraints using multiway merge selection networks
- Pairwise Cardinality Networks
- A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints
This page was built for publication: Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency