| 2008 |
|---|
| 36 | EE | Dimitris Bertsimas,
Guglielmo Lulli,
Amedeo R. Odoni:
The Air Traffic Flow Management Problem: An Integer Optimization Approach.
IPCO 2008: 34-46 |
| 35 | EE | Dimitris Bertsimas,
Dessislava Pachamanova:
Robust multiperiod portfolio management in the presence of transaction costs.
Computers & OR 35(1): 3-17 (2008) |
| 2007 |
|---|
| 34 | EE | Dimitris Bertsimas,
Karthik Natarajan:
A semidefinite optimization approach to the steady-state analysis of queueing systems.
Queueing Syst. 56(1): 27-39 (2007) |
| 2006 |
|---|
| 33 | EE | Michele Aghassi,
Dimitris Bertsimas:
Robust game theory.
Math. Program. 107(1-2): 231-273 (2006) |
| 32 | EE | Dimitris Bertsimas,
Melvyn Sim:
Tractable Approximations to Robust Conic Optimization Problems.
Math. Program. 107(1-2): 5-36 (2006) |
| 31 | EE | Dimitris Bertsimas,
Constantine Caramanis:
Bounds on linear PDEs via semidefinite optimization.
Math. Program. 108(1): 135-158 (2006) |
| 30 | EE | Dimitris Bertsimas,
Karthik Natarajan,
Chung-Piaw Teo:
Persistence in discrete optimization under data uncertainty.
Math. Program. 108(2-3): 251-274 (2006) |
| 29 | EE | Michele Aghassi,
Dimitris Bertsimas,
Georgia Perakis:
Solving asymmetric variational inequalities via convex optimization.
Oper. Res. Lett. 34(5): 481-490 (2006) |
| 2004 |
|---|
| 28 | EE | Dimitris Bertsimas,
Aurélie Thiele:
A Robust Optimization Approach to Supply Chain Management.
IPCO 2004: 86-100 |
| 27 | EE | Dimitris Bertsimas,
Santosh Vempala:
Solving convex programs by random walks.
J. ACM 51(4): 540-556 (2004) |
| 26 | EE | Dimitris Bertsimas,
Dessislava Pachamanova,
Melvyn Sim:
Robust linear optimization under general norms.
Oper. Res. Lett. 32(6): 510-516 (2004) |
| 2003 |
|---|
| 25 | EE | Dimitris Bertsimas,
Adam J. Mersereau,
Nitin R. Patel:
Dynamic Classification of Online Customers.
SDM 2003 |
| 2002 |
|---|
| 24 | EE | Dimitris Bertsimas,
Santosh Vempala:
Solving convex programs by random walks.
STOC 2002: 109-115 |
| 1999 |
|---|
| 23 | | Dimitris Bertsimas,
David Gamarnik:
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing.
J. Algorithms 33(2): 296-318 (1999) |
| 22 | | Dimitris Bertsimas,
David Gamarnik,
John N. Tsitsiklis:
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach.
Machine Learning 35(3): 225-245 (1999) |
| 21 | EE | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
Analysis of LP relaxations for multiway and multicut problems.
Networks 34(2): 102-114 (1999) |
| 20 | EE | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
On dependent randomized rounding algorithms.
Oper. Res. Lett. 24(3): 105-114 (1999) |
| 19 | EE | Dimitris Bertsimas,
Georgia Mourtzinou:
Decomposition results for general polling systems and their applications.
Queueing Syst. 31(3-4): 295-316 (1999) |
| 18 | | Dimitris Bertsimas,
Ioannis Ch. Paschalidis,
John N. Tsitsiklis:
Large deviations analysis of the generalized processor sharing policy.
Queueing Syst. 32(4): 319-349 (1999) |
| 17 | EE | Dimitris Bertsimas,
David Gamarnik,
John N. Tsitsiklis:
Performance analysis of multiclass queueing networks.
SIGMETRICS Performance Evaluation Review 27(3): 11-14 (1999) |
| 1998 |
|---|
| 16 | | Dimitris Bertsimas,
Rakesh V. Vohra:
Rounding algorithms for covering problems.
Math. Program. 80: 63-89 (1998) |
| 1997 |
|---|
| 15 | EE | Dimitris Bertsimas,
David Gamarnik,
John N. Tsitsiklis:
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach.
COLT 1997: 314-324 |
| 14 | | Dimitris Bertsimas,
Xiaodong Luo:
On the worst case complexity of potential reduction algorithms for linear programming.
Math. Program. 77: 321-333 (1997) |
| 13 | EE | Dimitris Bertsimas,
Chung-Piaw Teo:
The parsimonious property of cut covering problems and its applications.
Oper. Res. Lett. 21(3): 123-132 (1997) |
| 12 | | Dimitris Bertsimas,
Georgia Mourtzinou:
Transient Laws of Non-Stationary Queueing Systems and Their Applications.
Queueing Syst. 25(1-4): 115-155 (1997) |
| 1996 |
|---|
| 11 | | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
On Dependent Randomized Rounding Algorithms.
IPCO 1996: 330-344 |
| 10 | | Chung-Piaw Teo,
Dimitris Bertsimas:
Improved Randomized Approximation Algorithms for Lot-Sizing Problems.
IPCO 1996: 359-373 |
| 1995 |
|---|
| 9 | | Dimitris Bertsimas,
Chung-Piaw Teo,
Rakesh Vohra:
Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.
IPCO 1995: 29-39 |
| 8 | | Dimitris Bertsimas,
Chung-Piaw Teo:
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems.
SODA 1995: 102-111 |
| 1994 |
|---|
| 7 | | Dimitris Bertsimas,
James B. Orlin:
A technique for speeding up the solution of the Lagrangean dual.
Math. Program. 63: 23-45 (1994) |
| 1993 |
|---|
| 6 | | Florin Avram,
Dimitris Bertsimas:
On a characterization of the minimum assignment and matching in the independent random model.
IPCO 1993: 161-169 |
| 5 | | Dimitris Bertsimas,
José Niño-Mora:
Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems.
IPCO 1993: 355-384 |
| 4 | | Michel X. Goemans,
Dimitris Bertsimas:
Survivable networks, linear programming relaxations and the parsimonious property.
Math. Program. 60: 145-166 (1993) |
| 1992 |
|---|
| 3 | | Dimitris Bertsimas,
James B. Orlin:
A Technique for Speeding up the Solution of the Lagrangian Dual.
IPCO 1992: 435-452 |
| 1990 |
|---|
| 2 | | Michel X. Goemans,
Dimitris Bertsimas:
On the Parsimonious Property of Connectivity Problems.
SODA 1990: 388-396 |
| 1988 |
|---|
| 1 | | Dimitris Bertsimas:
An Exact FCFS Waiting Time Analysis for a General Class of G/G/s Queueing Systems.
Queueing Syst. 3(4): 305-320 (1988) |
