"Solving Convex Optimization Problems by Random Walks."

Dimitris Bertsimas and Santosh Vempala. In Proceedings of the 34th ACM Symposium on the Theory of Computing, Montréal, Québec: May 2002.

"An Approximate Dynamic Programming Approach to Multi-dimensional Knapsack Problems."

Bertsimas, Dimitris and Ramazan Demir. Management Science Vol. 48, No. 4 (2002): 550-565.

"From Fluid Relaxations to Practical Algorithms for Job Shop Scheduling: The Makespan Objective."

Bertsimas, Dimitris and Jay Sethuraman. Mathematical Programming Vol. 92, No. 1 (2002): 61-102.

"On the Relation Between Option and Stock Prices: A Convex Optimization Approach."

Bertsimas, Dimitris and Ioana Popescu. Operations Research Vol. 50, No. 2 (2002): 358-374.

"Performance Bounds for Multiclass Queueing Networks via Piecewise Linear Liapunov Functions."

Bertsimas, Dimitris, David Gamarnik and John N. Tsitsiklis. Annals of Applied Probability Vol. 11, No. 4 (2001): 1384-1428.

"Multistage Lot Sizing Problems via Randomized Rounding."

Teo, Chungpiaw and Dimitris Bertsimas. Operations Research Vol. 49, No. 4 (2001): 599-608.