AAAAAA

   
Results: 1-20 |
Results: 20

Authors: Teo, CP Bertsimas, D
Citation: Cp. Teo et D. Bertsimas, Multistage lot sizing problems via randomized rounding, OPERAT RES, 49(4), 2001, pp. 599-608

Authors: Bertsimas, D Kogan, L Lo, AW
Citation: D. Bertsimas et al., Hedging derivative securities and incomplete markets: An epsilon-arbitrageapproach, OPERAT RES, 49(3), 2001, pp. 372-397

Authors: Bertsimas, D Paschalidis, IC
Citation: D. Bertsimas et Ic. Paschalidis, Probabilistic service level guarantees in make-to-stock manufacturing systems, OPERAT RES, 49(1), 2001, pp. 119-133

Authors: Bertsimas, D Kogan, L Lo, AW
Citation: D. Bertsimas et al., When is time continuous?, J FINAN EC, 55(2), 2000, pp. 173-204

Authors: Bertsimas, D Patterson, SS
Citation: D. Bertsimas et Ss. Patterson, The traffic flow management rerouting problem in air traffic control: A dynamic network flow approach, TRANSP SCI, 34(3), 2000, pp. 239-255

Authors: Bertsimas, D Nino-Mora, J
Citation: D. Bertsimas et J. Nino-mora, Restless bandits, linear programming relaxations, and a primal-dual index heuristic, OPERAT RES, 48(1), 2000, pp. 80-90

Authors: Bertsimas, D Perakis, G Tayur, S
Citation: D. Bertsimas et al., A new algebraic geometry algorithm for integer programming, MANAG SCI, 46(7), 2000, pp. 999-1008

Authors: Bertsimas, D Lo, AW Hummel, P
Citation: D. Bertsimas et al., Optimal control of execution costs for portfolios, COMPUT SC E, 1(6), 1999, pp. 40-53

Authors: Bertsimas, D Gamarnik, D Tsitsiklis, JN
Citation: D. Bertsimas et al., Estimation of time-varying parameters in statistical models: An optimization approach, MACH LEARN, 35(3), 1999, pp. 225-245

Authors: Bertsimas, D Nino-Mora, J
Citation: D. Bertsimas et J. Nino-mora, Optimization of multiclass queueing networks with changeover times via theachievable region approach: Part I, the single-station case, MATH OPER R, 24(2), 1999, pp. 306-330

Authors: Bertsimas, D Nino-Mora, J
Citation: D. Bertsimas et J. Nino-mora, Optimization of multiclass queueing networks with changeover times via theachievable region approach: Part II, the multi-station case, MATH OPER R, 24(2), 1999, pp. 331-361

Authors: Bertsimas, D Paschalidis, IC Tsitsiklis, JN
Citation: D. Bertsimas et al., Large deviations analysis of the generalized processor sharing policy, QUEUEING S, 32(4), 1999, pp. 319-349

Authors: Bertsimas, D Mourtzinou, G
Citation: D. Bertsimas et G. Mourtzinou, Decomposition results for general polling systems and their applications, QUEUEING S, 31(3-4), 1999, pp. 295-316

Authors: Bertsimas, D Gamarnik, D
Citation: D. Bertsimas et D. Gamarnik, Asymptotically optimal algorithms for job shop scheduling and packet routing, J ALGORITHM, 33(2), 1999, pp. 296-318

Authors: Bertsimas, D Teo, CP Vohra, R
Citation: D. Bertsimas et al., On dependent randomized rounding algorithms, OPER RES L, 24(3), 1999, pp. 105-114

Authors: Bertsimas, D Darnell, C Soucy, R
Citation: D. Bertsimas et al., Portfolio construction through mixed-integer programming at Grantham, Mayo, Van Otterloo and Company, INTERFACES, 29(1), 1999, pp. 49-66

Authors: Bertsimas, D Chryssikou, T
Citation: D. Bertsimas et T. Chryssikou, Bounds and policies for dynamic routing in loss networks, OPERAT RES, 47(3), 1999, pp. 379-394

Authors: Bertsimas, D Teo, CP Vohra, R
Citation: D. Bertsimas et al., Analysis of LP relaxations for multiway and multicut problems, NETWORKS, 34(2), 1999, pp. 102-114

Authors: Bertsimas, D Paschalidis, IC Tsitsiklis, JN
Citation: D. Bertsimas et al., On the large deviations behavior of acyclic networks of G/G/1 queues, ANN APPL PR, 8(4), 1998, pp. 1027-1069

Authors: Bertsimas, D Teo, CP
Citation: D. Bertsimas et Cp. Teo, From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems, OPERAT RES, 46(4), 1998, pp. 503-514
Risultati: 1-20 |