Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546): Difference between revisions

@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
+Normal rank
@@ Property / cites work @@
+A Tabu Search Heuristic for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Using tabu search techniques for graph coloring
@@ Property / cites work: Using tabu search techniques for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized coloring for tree-like graphs
@@ Property / cites work: Generalized coloring for tree-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2761069
@@ Property / cites work: Q2761069 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalizing AllDifferent: The SomeDifferent Constraint
+Normal rank
@@ Property / cites work @@
+Principles and Practice of Constraint Programming – CP 2003
+Normal rank