Worst case analysis of two heuristics for the set partitioning problem
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 1, pp. 11-23. 
@article{ITA_1987__21_1_11_0,
     author = {Marchetti Spaccamela, A. and Pelaggi, A.},
     title = {Worst case analysis of two heuristics for the set partitioning problem},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {11--23},
     publisher = {EDP-Sciences},
     volume = {21},
     number = {1},
     year = {1987},
     mrnumber = {882867},
     zbl = {0635.68030},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1987__21_1_11_0/}
}
TY  - JOUR
AU  - Marchetti Spaccamela, A.
AU  - Pelaggi, A.
TI  - Worst case analysis of two heuristics for the set partitioning problem
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1987
SP  - 11
EP  - 23
VL  - 21
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1987__21_1_11_0/
LA  - en
ID  - ITA_1987__21_1_11_0
ER  - 
%0 Journal Article
%A Marchetti Spaccamela, A.
%A Pelaggi, A.
%T Worst case analysis of two heuristics for the set partitioning problem
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1987
%P 11-23
%V 21
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1987__21_1_11_0/
%G en
%F ITA_1987__21_1_11_0
Marchetti Spaccamela, A.; Pelaggi, A. Worst case analysis of two heuristics for the set partitioning problem. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 1, pp. 11-23. http://www.numdam.org/item/ITA_1987__21_1_11_0/

[FM] M. Fischetti and S. Martello, Worst-Case Analysis of the Differencing Method for the Partition Problem, Internal Report University of Bologna, 1986. | MR

[G] R. L. Graham, E. L. Lawler, J. K. Lenstra and A. K. G. Rinnooy Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling : a Survey, Ann. Discrete Math., 1978. | MR

[J] D. S. Johnson, Approximation Algorithms for Combinatorial Problem 2, Journal of Computer and System Sciences, Vol. 9, 1974, pp. 256-278. | MR

[KK] N. Karmarkar and R. M. Karp, The Differencing Method of Set Partitioning, Mathematics of Operations Research (to appear).

[K] R. M. Karp, R. E. Miller and J. W. Thatcher, Reducibility Among Combinatorial Problems, Complexity of Computer Computation, Plenum Press, N.Y., 1972. | MR | Zbl