Dimitris Bertsimas

Boeing Leaders for Global Operations Professor of Management
Professor of Operations Research
Co-Director, Operations Research Center

Biography | Selected Publications

An Accelerated First-Order Method for Solving Unconstrained SOS Polynomial Optimization Problems.” Dimitris Bertsimas, Robert M. Freund, and Xu Andy Sun. Optimization Methods and Software 28(3): 424-441 (2013)

Introduction to Linear Optimization. Bertsimas, Dimitris, and John N. Tsitsiklis. Dynamic Ideas and Athena Scientific, Belmont, Massachusetts, 2008.

Optimization over Integers. Bertsimas, Dimitris, and Robert Weismantel. Dynamic Ideas, Belmont, Massachussetts, 2005.

Data, Models, and Decisions: The Fundamentals of Management Science. Bertsimas, Dimitris, and Robert Freund. Belmont, MA: Dynamic Ideas, LLC, 2004.

On The Relation Between Option and Stock Prices: A Convex Optimization Approach (1999)

Branching bandits and Klimov's problem: achievable region and side constraints (1995)

Locating discretionary service facilities II: maximizing market size, minimizing inconvenience (1995)

Optimization of multiclass queueing networks: a linear control approach (1995)

The distributional Little's law and its applications (1995)

A technique for speeding up the solution of the Lagrangean dual (1994)

Dynamic ground-holding policies for a network of airports (1994)

Optimization of multiclass queueing networks: polyhedral and nonlinear characterizations of achievable performance (1994)

The multi-airport ground-holding problem in air trac control (1994)

Further results on the probabilistic traveling salesman problem (1993)

On central limit theorems in geometrical probability (1993)

“Simulated annealing.” Bertsimas, Dimitris, and John Tsitsiklis (1993). Statistical Science, 8(1): 10-15. (1993)

Stochastic and dynamic vehicle routing in the Euclidean Plane: the multiple-server, capacitated vehicle case (1993)

Stochastic and dynamic vehicle routing with general arrival and demand distributions (1993)

Survivable networks, LP relaxations and the parsimonious property (1993)

“A vehicle routing problem with stochastic demand.” Bertsimas, Dimitris (May 1992). Operations Research, 40, 574-585, 1992.

“Deducing queueing from transactional data: the queue inference engine, revisited." Bertsimas, Dimitris, and L.D. Servi (1992). Operations Research, 40, S217-S228. (1992)

“The minimum spanning tree constant in geometrical probability and under the independent model: a unified approach.” Avram, Florin, and Dimitris Bertsimas (1992). Annals of Applied Probability, 2(1): 113-130. (1992)

“Transient and busy period analysis for the GI/G/1 queue; The method of stages." Bertsimas, Dimitris, and Daisuke Nakazato (1992). Queueing Systems and Applications, 10 153-184. (1992)

“A stochastic and dynamic vehicle routing problem in the Euclidean plane.” Bertsimas, Dimitris, and Garrett Van Ryzin (1991). Operations Research, 39, 4, 601-615, 1991.

On Central Limit Theorems in Geometrical Probability (1991)

“Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem.” Bertsimas, Dimitris, and Michel Goemans (1991). Mathematics of Operations Research, 16(1): 72-89.  (1991)

"Transient and busy period analysis of the GI/G/1 queue as a Hilbert factorization problem." Bertsimas, Dimitris, Julian Keilson, Daisuke Nakazato, and Hongtao Zhang (1991). Journal of Applied Probability, 28, 873-885. (1991)

“A priori optimization." Bertsimas, Dimitris, Patrick Jaillet, and Amedeo Odoni (1990). Operations Research, 38(6): 1019-1033. (1990)

“An analytic approach to a general class of G/G/s queueing systems.” Bertsimas, Dimitris (1990). Operations Research, 38(1): 139-155. (1990)

“An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability.” Bertsimas, Dimitris, and Garrett van Ryzin (1990). Operations Research Letters, 9(4): 223- 231. (1990)

“Relations between the pre-arrival and post-departures state probabilities and the FCFS waiting-time distribution for the Ek/G/s queue.” Bertsimas, Dimitris, and Xenophon Papaconstantinou (1990). Naval Research Logistics Quarterly, 37: 135-149. (1990)

“The probabilistic minimum spanning tree problem.” Bertsimas, Dimitris (1990). Networks, 20(3): 245-275. (1990)

“Traveling salesman facility location problems.” Bertsimas, Dimitris (August 1989). Transportation Science, 23(3): 184-191.

“Worst case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem.” Bertsimas, Dimitris, and Michelangelo Grigni (1989). Operations Research Letters, 8: 241-244. (1989)

“An exact FCFS waiting-time analysis for a general class of G/G/s queueing systems.” Bertismas, Dimitris (1988). Queueing Systems Theory and Applications, 3(4): 305-320 (1988)

“On the exact steady state solution of the Ek/C2/s queue." Bertsimas, Demitris, and Xenophon A. Papaconstantinou (1988). European Journal of Operations Research, 37(2), 272-287. (1988)

“On the steady-state solution of the M/C2(a, b)/s queueing system.” Bertsimas, Dimitris, and Xenophon Papaconstantinou (1988). Transportation Science, 22(2): 125-138. (1988)

 

Contact Information
Office: E40-147
Tel: (617) 253-4223
Fax: (617) 258-9214
Support Staff
Name: Andrew Carvalho
Tel: (617) 253-3601

Research Center(s)

General Expertise
Air safety; eCommerce; Financial engineering; Information technology; Operations research; Optimization; Revenue management; Statistics