The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dimitris Bertsimas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  35. The Air Traffic Flow Management Problem: An Integer Optimization Approach. [Citation Graph (, )][DBLP]


  36. Optimality of affine policies in multi-stage robust optimization. [Citation Graph (, )][DBLP]


  37. Robust multiperiod portfolio management in the presence of transaction costs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002