A complete anytime algorithm for number partitioning
- 1 December 1998
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 106 (2) , 181-203
- https://doi.org/10.1016/s0004-3702(98)00086-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Easily searched encodings for number partitioningJournal of Optimization Theory and Applications, 1996
- A study of complexity transitions on the asymmetric traveling salesman problemArtificial Intelligence, 1996
- The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and KarpMathematics of Operations Research, 1996
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number PartitioningOperations Research, 1991
- Phase transitions in artificial intelligence systemsArtificial Intelligence, 1987
- Probabilistic analysis of optimum partitioningJournal of Applied Probability, 1986
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete ProblemsSIAM Journal on Computing, 1981
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974