Reduction of the Three-Partition Problem

Journal of Combinatorial Optimization

Volumn 3, Issue 1, 1999, Pages 17-30

  Dell'Amico, Mauro ^a   Martello, Silvano ^b  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Combinatorial properties; Partition; Reduction

Indexed keywords

EID: 0012851340     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009856820553     Document Type: Article

References (8)

1. M. Dell'Amico and S. Martello "Optimal scheduling of tasks on identical parallel processors," ORSA Journal on Computing, vol. 7, pp. 191-200, 1995.
2. M.R. Garey and D.S. Johnson, "Complexity results for multiprocessors scheduling under resource constraints," SIAM Journal on Computing, vol. 4, pp. 397-411, 1975.
3. M.R. Garey, D.S. Johnson, and R. Sethi, "The complexity of flowshop and jobshop scheduling," Mathematics of Operations Research, vol. 1, pp. 117-129, 1976.
4. M.R. Garey and D.S. Johnson, "Strong" NP-completeness results: Motivation, examples and implications," Journal of ACM, vol. 25, pp. 499-508, 1978.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: San Francisco, 1979.
6. J.A. Hoogeveen, J.K. Lenstra, and S.L. van de Velde, "Sequencing and scheduling," in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello (Eds.), Wiley: Chichester, 1997.
7. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker, "Complexity of machine scheduling problems," Annals of Discrete Mathematics, vol. 1, pp. 343-362, 1977.
8. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley: Chichester, 1990.