The problems addressed within CASTLE Lab require a variety of skill sets. Sometimes, some really creative engineering will solve the problem. However, we routinely run across problems where a simple patch will simply not work reliably, and we have to really solve the problem. These are often technically difficult, mathematically demanding, requiring substantial amounts of experimentation.
The graduate students in CASTLE Lab can lay claim to some of our most dramatic technical breakthroughs. Most of the technology that is currently making its way into the field can be traced to the work of the students who have participated in the lab. Each student, with their unique interests and skills, has contributed in a substantial way to the knowledge base that currently makes up our research program.
Current graduate students:
Ekaterina Jager
Jun Ma
Ilya Rhyzov
Peter Frazier
Kazu Yamazaki (jointly supervised with Savas Dayanik)
Juliana Nascimento
Johannes Enders
Past graduates (Ph.D.)
Academic placement:
Katerina Papadaki, 2002, “Adaptive Dynamic Programming for Aging and Replenishment Processes,” First position: London School of Economics.
Huseyin Topaloglu, 2001, “Dynamic Programming Approximations for Dynamic Resource Allocation Problems,” First position: Operations Research and Industrial Engineering, Cornell University.
Mike Spivey, 2001, “The Dynamic Assignment Problem,” First position: Math department, Samford University.
Zhi-Long Chen, 1997, “Algorithms for Deterministic and Stochastic Scheduling,” First position: Department of Systems Engineering, University of Pennsylvania.
Raymond K.-M. Cheung, 1993, “Dynamic Networks with Random Arc Capacities: Solution Methods and Applications,” First position: Industrial engineering, Iowa State University.
Judy Farvolden, 1989, “A Primal Partitioning Solution for the Multicommodity Network Flow Problem,” First position: Industrial Engineering, University of Toronto
Yiannis Koskosidis, 1988, “Optimization-Based Models and Algorithms for Routing and Scheduling with Time Window Constraints,” First position: City University of New York.
Hugo P. Simao, 1987, “Numerical, Discrete-Time Simulation of Transportation Queueing Networks,” First position: Associate Professor, Instituto Tecnologico de Aeronautica, Brazil.Research laboratories:
Abraham George, 2005, “Optimal Learning Strtegies for Multi-Attribute Resource Allocation Problems,” First position: Research staff, Princeton University.
Tongqiang Wu, 2004, “The Optimizing Simulator for the Military Airlift Problem,” First position: Lawrence Livermore National Laboratory.
Tassio Carvalho, 1996, “Dynamic Control of Spatial Resource Allocation Problems,” First position: IBM Watson Research Labs.
Linos Frantzeskakis, 1990, “Dynamic Networks with Random Arc Capacities, with Application to the Stochastic Dynamic Vehicle Allocation Problem,” First position: AT&T Bell Laboratories.
Industry:
Gregory Godfrey, 2007, “Nonlinear Approximation Method for Solving Stochastic, Dynamic Resource Allocation Problems,” First position: Metron Inc.
Arun Marar, 2002, “Information Representation in Large-Scale Resource Allocation Problems: Theory, Algorithms and Applications.” First position: Amaranth Advisers
Joel Shapiro, 1999, “A Framework for Representing and Solving Dynamic Resource Transformation Problems,” First position: i2 Technologies.
Past graduates (Masters)
Jayanth Marasanapalle, 2000, “Function Approximations for Integer, Stochastic Resource Allocation Problems.”
Tom Dong, 1998, “A Dynamic Programming Approximation for the Dynamic Assignment Problem.”
Sheraz Shere, 1996, “A Dynamic Programming Approximation for the Driver Assignment Problem.”
Mike Towns, 1997, “The Impact of User Noncompliance and System Stochasticity on Dynamic Routing Problems: A Study of the Truckload Industry.”
Tony Snow, 1996, “Adaptive Labeling Algorithms for the Dynamic Assignment Problem.”
Derek Gittoes, 1994, “A Generalized Labeling Algorithm for Solving the Dynamic Assignment Problem.”
Mary-Ellen Noyes, 1993, “Validation and Testing of a Stochastic, Dynamic Fleet Management System.”