Select Page

Published Papers

1990’s: 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1990 | 1989

2010 – 2019 |  2000 – 2009 |  1990 – 1989

1999

Analysis of LP relaxations for multiway and multicut problems
with C. Teo and R. Vohra, Networks, 34, 2, 102-113, 1999

On dependent randomized rounding algorithms
with C. Teo and R. Vohra, Submitted to Operations Research Letters, 1999

Optimal control of execution costs for portfolios
with Paul Hummel and Andrew Lo, Computing in Science and Engineering, 40-53, 1999.

Portfolio construction through mixed integer programming
with C. Darnell and R. Soucy, Interfaces, 29, 49-66, 1999.

Large deviation analysis of the generalized processor sharing policy
with I. Paschalidis and J. Tsitsiklis, Queuing Systems and their Applications, 32, 319-349, 1999.

Estimation of time-varying parameters in statistical models: an optimization approach
with D. Gamarnik and J. Tsitsiklis, Machine Learning, 35, 3, 225-245, 1999.

Decomposition results for general polling systems and their applications
with G. Mourtzinou, Queuing Systems and their Applications, 31, 295-316, 1999.

Bounds and policies for loss networks
with T. Chryssikou, Operations Research, 47, 3, 379-394, 1999.

Asymptotically optimal algorithms for job shop scheduling and packet routing
with D. Gamarnik, Journal of Algorithms, 33, 296-318, 1999.

Optimization of multiclass queuing networks with changeover times via the achievable region approach: Part I, the single-station case
with J. Niño-Mora, Mathematics of Operations Research, 24, 2, 306-329, 1999.

Optimization of multiclass queuing networks with changeover times via the achievable region approach: Part II, the multi-station case
with J. Niño-Mora, Mathematics of Operations Research, 24, 2, 331-361, 1999.

1998

The air traffic flow management problem with enroute capacities
with S. Stock-Paterson, Operations Research, 46, 3, 406-422, 1998.

From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems
with C. Teo), Operations Research, 46, 4, 503-514, 1998.

Rounding algorithms for covering problems
with R. Vohra, Mathematical Programming, 80, 63-89, 1998.

Semidefinite relaxations, multivariate normal distributions, and order statistics
with Y. Ye, Handbook of Combinatorial Optimization (Vol. 3), D.-Z. Du and P.M. Pardalos (Eds.) pp.1-19 ,Kluwer Academic Publishers, 1998.

Optimal control of execution costs
with Andrew Lo, Journal of Financial Markets, 1, 1-50, 1998.

On the large deviation behavior in acyclic networks of G/G/1 queues
with I. Paschalidis and J. Tsitsiklis, Annals of Applied Probability, 8, 4, 1027-1069, 1998.

Asymptotic buffer overflow probabilities in multiclass multiplexers
with I. Paschalidis and J. Tsitsiklis, IEEE Automatic Control, 43, 3, 315-335, 1998.

A new algorithm for state-constrained separated continuous linear programs
with X. Luo, SIAM Journal on Control and Optimization, 37, 1, 177-210, 1998.

1997

The parsimonious property of cut covering problems and its applications
with C. Teo, Operations Research Letters, 21, 123-132, 1997.

On the worst case complexity of potential reduction algorithms for linear programming
with X. Luo, Mathematical Programming. 77, 321-333, 1997.

Multiclass queuing systems in heavy traffic: an asymptotic approach based on distributional and conservation laws
with G. Mourtzinou, Operations Research, 45, 3, 470-487, 1997.

Transient distributional laws and their applications
with G. Mourtzinou, Queuing Systems and their Applications, 25, 115-155, 1997.

1996

Improved Randomized Approximation Algorithms for Lot Sizing Problems
with C. Teo, Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, 1996.

A unified method to analyze overtake free systems
with G. Mourtzinou, Advances in Applied Probability, 28, 588-625, 1996.

Stability conditions for multiclass fluid networks
with D. Gamarnik and J. Tsitsiklis, IEEE Automatic Control, 41, 1618-1631, 1996.

Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; a Polyhedral Approach to Indexable Systems
with Jose Niño-Mora, Mathematics of Operations Research, 21, 2, 257-306, 1996.

A new generation of vehicle routing research
with D. Simchi-Levi, Operations Research, 44, 2, 286-304, 1996.

1995

Computational approaches to stochastic vehicle routing problems
with P. Chervi and M. Peterson, Transportation Science, 29, 4, 342-352, 1995.

Decomposition algorithms for analyzing transient phenomena in multi-class queuing networks in air transportation
with A. Odoni and M. Peterson, Operations Research, 43, 6, 995-1011, 1995.

Models and Algorithms for Transient Queuing Congestion at Airports
with A. Odoni and M. Peterson, Management Science, 41, 1279-1295, 1995.

Locating discretionary service facilities II: maximizing market size, minimizing inconvenience
with O. Berman and R. Larson, Operations Research, 43, 4, 623-632, 1995.

The distributional Little’s law and its applications
with D.Nakazato, Operations Research, 43, 2, 298-310, 1995.

Optimization of multiclass queuing networks:a linear control approach
with F. Avram and M. Ricard, Stochastic networks; proceedings of the IMA, (F. Kelly and R. Williams, editors), 199-234, 1995.

Branching bandits and Klimov’s problem: achievable region and side constraints
with I. Paschalidis and J. Tsitsiklis, IEEE Automatic Control, 40, 12, 2063-2075, 1995.

The achievable region method in the optimal control of queuing systems; formulations, bounds and policies
Queuing Systems and Applications, 21, 3-4,337-389, 1995.

1994

The multi-airport ground-holding problem in air traffic control
with A. Odoni and P. Vranas, Operations Research, 42, 2, 249-261, 1994

Dynamic ground-holding policies for a network of airports
with A. Odoni and P. Vranas, Transportation Science, 28, 4, 275-291, 1994

A technique for speeding up the solution of the Lagrangean dual
with J. Orlin, Mathematical Programming, vol. 63, 1, 23-46, 1994

Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance
with I. Paschalidis and J. Tsitsiklis, Annals of Applied Probability, 4, 1, 43-75, 1994

1993

On central limit theorems in geometrical probability
with F. Avram, Annals of Applied Probability, vol. 3, 4, 1033-1046, 1993

Survivable networks, LP relaxations and the parsimonious property
with M. Goemans, Mathematical Programming, 60, 145-166, 1993

Simulated annealing
with J. Tsitsiklis, Statistical Science, Vol.8, No. 1, 10-15, 1993

Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
with G. van Ryzin, Operations Research, 41, 60-76, 1993

Further results on the probabilistic traveling salesman problem
with L. Howell, European Journal of Operations Research, 65, 1, 68-95, 1993

Stochastic and dynamic vehicle routing with general arrival and demand distributions
with G. van Ryzin, Advances in Applied Probability, 25, 4, 947-978, 1993

1992

The minimum spanning tree constant in geometrical probability and under the independent model; a unified approach
with F. Avram, Annals of Applied Probability, vol. 2 ,1, 113-130, 1992

Deducing queuing from transactional data: the queue inference engine, revisited
with L. Servi, Operations Research, 40, S217-S228, 1992

Transient and busy period analysis for the GI/G/1 queue; The method of stages
with D. Nakazato, Queuing Systems and Applications, 10, 153-184, 1992

A vehicle routing problem with stochastic demand
Operations Research, 40, 574-585, 1992

1991

A stochastic and dynamic vehicle routing problem in the Euclidean plan
with G. van Ryzin, Operations Research, 39, 4, 601-615, 1991

Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem
with M. Goemans, Mathematics of Operations Research, 1, 72-89, 1991

Transient and busy period analysis of the GI/G/1 queue as a Hilbert factorization problem
with J. Keilson, D. Nakazato, H. Zhang, Journal of Applied Probability, 28, 873-885, 1991

1990

A priori optimization
with P. Jaillet and A. Odoni, submitted to Operations Research, 1990

The probabilistic minimum spanning tree problem
Networks, 1990

An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
with G. van Ryzin, Operations Research Letters, 9, 223-231, 1990

An analytic approach to a general class of G/G/s queuing systems
Operations Research, 38, 1, 139-155, 1990

1989

On probabilistic traveling salesman facility location problems
submitted to Transportation Science, 1989

Worst case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
with M. Grigni, Operations Research Letterswith I. Dunning and H. Bidkhori 1989