A complete anytime algorithm for number partitioning (Q1277696): Difference between revisions

@@ Property / cites work @@
+Q3198897
@@ Property / cites work: Q3198897 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of optimum partitioning
@@ Property / cites work: Probabilistic analysis of optimum partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Easily searched encodings for number partitioning
@@ Property / cites work: Easily searched encodings for number partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank
@@ Property / cites work @@
+The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
+Normal rank
@@ Property / cites work @@
+A study of complexity transitions on the asymmetric traveling salesman problem
+Normal rank