de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Book Chapter

Linear time approximation schemes for shop scheduling problems

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44695

Jansen,  Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45136

Solis-Oba,  Roberto
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Jansen, K., Solis-Oba, R., & Sviridenko, M. (2000). Linear time approximation schemes for shop scheduling problems. In P. M. Pardalos (Ed.), Approximation and complexity in numerical optimization (pp. 338-346). Dordrecht, The Netherlands: Kluwer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-33CF-C
Abstract
There is no abstract available