Approximation algorithms for packing and scheduling problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2004.
Autor principal: | Correa, José Rafael, 1975- |
---|---|
Outros Autores: | Michael X. Goemans and Andreas S. Schulz. |
Formato: | Tese |
Idioma: | eng |
Publicado em: |
Massachusetts Institute of Technology
2005
|
Assuntos: | |
Acesso em linha: | http://hdl.handle.net/1721.1/17720 |
Registros relacionados
-
Algorithms for locomotive scheduling
por: Chandra, Anurag, 1977-
Publicado em: (2023) -
Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations
por: Mittal, Shashi, Ph. D. Massachusetts Institute of Technology
Publicado em: (2012) -
Algorithmic and game-theoretic perspectives on scheduling
por: Uhan, Nelson A. (Nelson Alexander)
Publicado em: (2009) -
Faster fully polynomial approximation schemes for Knapsack problems
por: Rhee, Donguk
Publicado em: (2015) -
Maintenance scheduling for modular systems-models and algorithms
por: Zarybnisky, Eric J. (Eric Jack), 1979-
Publicado em: (2012)