Theses most similar to Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations (Mittal, Shash; 2011) read it

Probabilistic methods in combinatorial and stochastic optimization

Vondrák, Jan, 1974- (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

Approximation algorithms for distributed and selfish agents

Mirrokni, Vahab S (2005)

  • Advisor: Michel Goemans
  • Department of Mathematics
Read it

Decoding error-correcting codes via linear programming

Feldman, Jon, 1975- (2003)

  • Advisor: David R. Karger
  • Department of Electrical Engineering and Computer Science
Read it

Algorithmic and game-theoretic perspectives on scheduling

Uhan, Nelson A. (Nelson Alexander) (2008)

  • Advisor: Andreas S. Schulz
  • Operations Research Center
Read it

Approximation algorithms for stochastic scheduling on unrelated machines

Scott, Jacob (Jacob Healy) (2008)

  • Advisor: David R. Karger
  • Department of Electrical Engineering and Computer Science
Read it

Combinatorial optimization problems with concave costs

Stratila, Dan (2009)

  • Advisor: Thomas L. Magnanti
  • Operations Research Center
Read it

Optimization under moment, robust, and data-driven models of uncertainty

Doan, Xuan Vinh (2010)

  • Advisor: Dimitris J. Bertsimas
  • Operations Research Center
Read it

Evaluation of cost balancing policies in multi-echelon stochastic inventory control problems

Yu, Qia (2010)

  • Advisor: Restef Levi
  • Computation for Design and Optimization Program
Read it

Effectiveness and design of sparse process flexibilities

Wei, Yehu (2013)

  • Advisor: David Simchi-Levi Roy Welsc
  • Operations Research Center
Read it

Analysis of approximation and uncertainty in optimization

Mastin, Dana Andrew (2015)

  • Advisor: Jaillet, Patrick
  • Department of Electrical Engineering and Computer Science
Read it