Worst case analysis of two heuristics for the set partitioning problem

A. Marchetti Spaccamela; A. Pelaggi

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1987)

  • Volume: 21, Issue: 1, page 11-23
  • ISSN: 0988-3754

How to cite

top

Marchetti Spaccamela, A., and Pelaggi, A.. "Worst case analysis of two heuristics for the set partitioning problem." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 21.1 (1987): 11-23. <http://eudml.org/doc/92274>.

@article{MarchettiSpaccamela1987,
author = {Marchetti Spaccamela, A., Pelaggi, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {set partitioning problem; scheduling},
language = {eng},
number = {1},
pages = {11-23},
publisher = {EDP-Sciences},
title = {Worst case analysis of two heuristics for the set partitioning problem},
url = {http://eudml.org/doc/92274},
volume = {21},
year = {1987},
}

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
PB - EDP-Sciences
VL - 21
IS - 1
SP - 11
EP - 23
LA - eng
KW - set partitioning problem; scheduling
UR - http://eudml.org/doc/92274
ER -

References

top
  1. [FM] M. FISCHETTI and S. MARTELLO, Worst-Case Analysis of the Differencing Method for the Partition Problem, Internal Report University of Bologna, 1986. MR881698
  2. [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. Zbl0388.90032MR522459
  3. [J] D. S. JOHNSON, Approximation Algorithms for Combinatorial Problem 2, Journal of Computer and System Sciences, Vol. 9, 1974, pp. 256-278. Zbl0296.65036MR449012
  4. [KK] N. KARMARKAR and R. M. KARP, The Differencing Method of Set Partitioning, Mathematics of Operations Research (to appear). 
  5. [K] R. M. KARP, R. E. MILLER and J. W. THATCHER, Reducibility Among Combinatorial Problems, Complexity of Computer Computation, Plenum Press, N.Y., 1972. Zbl0366.68041MR378476

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.