Complexity and approximation in routing and scheduling

Research output: Thesis › Phd Thesis 1 (Research TU/e / Graduation TU/e)

631 Downloads (Pure)

Original language	Dutch
Qualification	Doctor of Philosophy
Awarding Institution	Mathematics and Computer Science
Supervisors/Advisors	Lenstra, Jan, Promotor Sgall, J., Promotor, External person Stougie, Leen, Copromotor
Award date	24 May 2004
Place of Publication	Eindhoven
Publisher	Technische Universiteit Eindhoven
Print ISBNs	90-386-0882-9
DOIs	https://doi.org/10.6100/IR578517
Publication status	Published - 2004

Access to Document

@phdthesis{b4fb0b15dc1548b39856b266fae98ca0,

title = "Complexity and approximation in routing and scheduling",

author = "R.A. Sitters",

year = "2004",

doi = "10.6100/IR578517",

language = "Nederlands",

isbn = "90-386-0882-9",

publisher = "Technische Universiteit Eindhoven",

type = "Phd Thesis 1 (Research TU/e / Graduation TU/e)",

school = "Mathematics and Computer Science",

}