An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint

This publication has 10 references indexed in Scilit:

• Fast Bound Consistency for the Global Cardinality Constraint
  Lecture Notes in Computer Science, 2003
• Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
  2001
• When do bounds and domain propagation lead to the same search space
  2001
• Constraint Programming in OPL
  Lecture Notes in Computer Science, 1999
• A filtering algorithm for global sequencing constraints
  Lecture Notes in Computer Science, 1997
• A deductive and object-oriented approach to a complex scheduling problem
  Lecture Notes in Computer Science, 1993
• Constraint satisfaction using constraint logic programming
  Artificial Intelligence, 1992
• A linear-time algorithm for a special case of disjoint set union
  1983
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
  Acta Informatica, 1981
• On Representatives of Subsets
  Journal of the London Mathematical Society, 1935