Project scheduling with irregular costs: Complexity, approximability, and algorithms

A. Grigoriev, Gerhard Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Original languageUndefined
Title of host publicationProceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC'2002)
EditorsP. Bose, P. Morin
Place of PublicationNew York
PublisherSpringer
Pages381-390
ISBN (Print)3-540-00142-5
DOIs
Publication statusPublished - 2002

Publication series

NameActa informatica
Number2-3
Volume41

Keywords

  • METIS-208663

Cite this

Grigoriev, A., & Woeginger, G. (2002). Project scheduling with irregular costs: Complexity, approximability, and algorithms. In P. Bose, & P. Morin (Eds.), Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC'2002) (pp. 381-390). (Acta informatica; Vol. 41, No. 2-3). New York: Springer. https://doi.org/10.1007/s00236-004-0150-2