The hardest constraint problems: A double phase transition (Q1337687): 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.1016/0004-3702(94)90088-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2002627038
@@ Property / OpenAlex ID: W2002627038 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558293
@@ Property / cites work: Q5558293 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3950588
@@ Property / cites work: Q3950588 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Easy problems are sometimes hard
@@ Property / cites work: Easy problems are sometimes hard / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
+Normal rank
@@ Property / cites work @@
+Q5687261
@@ Property / cites work: Q5687261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680834
@@ Property / cites work: Q3680834 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting the deep structure of constraint problems
+Normal rank