The differencing algorithm LDM for partitioning: A proof of a conjecture of Karmarkar and Karp

Mathematics of Operations Research

Volumn 21, Issue 1, 1996, Pages 85-99

  Yakir, Benjamin ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Differencing method; Makespan; Partitioning; Probabilistic analysis of algorithms; Scheduling

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBABILITY; SCHEDULING;

BLOCK SUM; DIFFERENCING ALGORITHM; LARGEST DIFFERENCING METHOD; MAKESPAN; PAIRED DIFFERENCING METHOD; PARTITIONING; PROBABILISTIC ANALYSIS;

ALGORITHMS;

EID: 0030082880     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.21.1.85     Document Type: Article

References (7)

1. Coffman, E. G., Jr. (1993). Private communication.
2. _, G. S. Lueker (1991). Probabilistic analysis of packing and partitioning algorithms, John Wiley and Sons. New York.
3. _, _, A. H. G. Rinnooy Kan (1988). Asymptotic methods in probabilistic analysis of sequencing and packing heuristics. Management Sci. 34 266-290.
4. Karmarkar, N., R. M. Karp (1982). The differencing method of set partitioning. Technical Report UCB/CSD 82/113 Computer Science Division (EECS), University of California, Berkeley.
5. Karp, R. M. (1989). Lecture notes. Computer Science Division (EECS), University of California, Berkeley.
6. Lueker, G. S. (1987). A note on the average-case behavior of a simple differencing method for partitioning. Oper. Res. Lett. 6 258-287.
7. Tsai, L. H. (1992). Asymptotic analysis of an algorithm for balanced parallel processor scheduling. SIAM J. Comput. 21 59-64.