Generalizing AllDifferent: The SomeDifferent Constraint

DOI10.1007/11889205_34zbMath1160.68561OpenAlexW2132315373MaRDI QIDQ3524252

Yossi Richter, Ari Freund, Yehuda Naveh

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11889205_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Hybrid tractability of valued constraint problems ⋮ Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ Using local search to speed up filtering algorithms for some NP-hard constraints

This page was built for publication: Generalizing AllDifferent: The SomeDifferent Constraint