Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-68155-7_26
+Normal rank
@@ Property / OpenAlex ID @@
+W1617540954
@@ Property / OpenAlex ID: W1617540954 / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / 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 @@
+Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
+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