Heuristic algorithms for balanced multi-way number partitioning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 693-698

  Zhang, Jilian ^a   Mouratidis, Kyriakos ^a   Pang, HweeHwa ^a  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; CARDINALITIES; EXACT ALGORITHMS; HEURISTIC TECHNIQUES; NOVEL STRATEGIES; NUMBER DISTRIBUTION; NUMBER PARTITIONING; SUBSET SUM;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

SET THEORY;

EID: 84881049459     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-122     Document Type: Conference Paper

References (8)

1. max problem. Journal of Scheduling, 4:123-138, 2001.
2. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
3. N. Karmarkar and R. Karp. The differencing method of set partitioning. Technical Report UCB/CSD 82/113, University of California, Berkeley, CA, 1982.
4. R. Korf. A complete anytime algorithm for number partitioning. Artificial Intelligence, 106(2):181-203, 1998. (Pubitemid 128431577)
5. Richard E. Korf. Multi-way number partitioning. In International Joint Conference on Artificial Intelligence, pages 538-543, 2009.
6. Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, and Jan van Leeuwen. Performance ratios for the differencing method applied to the balanced number partitioning problem. In Symposium on Theoretical Aspects of Computer Science, pages 583-595, 2003.
7. L. Tasi. The modified differencing method for the set partitioning problem with cardinality constraints. Discrete Applied Mathematics, 63:175-180, 1995.
8. B. Yakir. The differencing algorithm LDM for partitioning: A proof of a conjecture of Karmarkar and Karp. Mathematics of Operations Research, 21(1):85-99, 1996. (Pubitemid 126600122)