Largest differencing method: Difference between revisions

Content deleted Content added
Line 107:
 
CKK can also run as an [[anytime algorithm]]: it finds the KK solution first, and then finds progressively better solutions as time allows (possibly requiring exponential time to reach optimality, for the worst instances).<ref>{{Cite journal|last=Korf|first=Richard E.|date=1998-12-01|title=A complete anytime algorithm for number partitioning|url=http://www.sciencedirect.com/science/article/pii/S0004370298000861|journal=Artificial Intelligence|language=en|volume=106|issue=2|pages=181–203|doi=10.1016/S0004-3702(98)00086-1|issn=0004-3702}}</ref>
 
By combining CKK with the balanced-LDM algorithm, it is possible to find an optimal solution to the ''balanced'' partition problem.<ref>{{Cite journal|last=Mertens|first=Stephan|date=1999-03-11|title=A complete anytime algorithm for balanced number partitioning|url=http://arxiv.org/abs/cs/9903011|journal=arXiv:cs/9903011}}</ref>
 
== Previous mentions ==