Robert M. Freund is the Thersa Seley Professor of Management Science. Rob Freund does research on the theory of constrained optimization. Rob teaches courses on constrained optimization for doctoral students and courses on management science methods for MBA students.
James B. Orlin is the Edward Pennell Brooks Professor of Operations Research. Professor Orlin specializes in network and combinatorial optimization. With two colleagues, he has written a graduate-level text, Network Flows: Theory, Algorithms, and Applications (1993). This text was the winner of the 1993 Lanchester Prize for the best English language publication in Operations Research. He is also interested in applications of network optimization and combinatorial optimization to logistics and vehicle routing.
Georgia Perakis is the Sloan Career Development Associate Professor of Operations Research. Her research interests include revenue management, dynamic pricing, and competitive supply chain management. Furthermore, she studies transportation, in particular, the study of traffic in dynamic settings and as well as more generally the study of optimization and its applications in both dynamic and static settings. She has received a number of awards for her research, including the CAREER PECASE award through the National Science Foundation which is awarded by the office of the President of the United States on Science and Technology to 59 early career researchers across all fields. In Spring 2002, she was the recipient of the Graduate Teaching Award for the Sloan School of Management for excellence in teaching. In the Fall of 2002, she received the Sloan Career Development Chair. Perakis has been an Associate Editor for the journal Management Science (1998-2002), as well as for the special issue of Management Science in Auctions and is currently an Area Editor in the area of Supply Chain Management and Services for the journal Networks and Spatial Economics and the Editor in Chief of the Journal of Revenue Management and Pricing. Perakis was elected at the Informs Council in 2003 and is the current chair of the Pricing and Revenue Management Section of the Informs society.
Andreas Schulz is The Class of 1958 Associate Professor of Operations Research. He teaches courses on the theory and practice of optimization and decision making. His main area of research is mathematical programming; his current interests include algorithmic game theory, approximation algorithms, combinatorial auctions, combinatorial optimization, integer programming, local search, network flows, online algorithms, polyhedral combinatorics, project management, and scheduling. He is on the editorial board of the INFORMS Journal on Computing and the Journal of Scheduling as well as a past editor of Operations Research.
Gordon M. Kaufman
Roy E. Welsch
Complexity of Convex Optimization Using Geometry-Based Measures and a Reference Point; R. M. Freund
Computation of Minimum Volume Covering Ellipsoids; P. Sun and R. M. Freund
Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization; F. Ordóñes and R. M. Freund
On an Extension of Condition Number Theory to Non-Conic Convex Optimization; R. M. Freund and F. Ordóñez
On The Complexity of Computing Estimates Of Condition
Measures of a Conic Linear System; R. M. Freund and J.
On the Primal-Dual Geometry of Level Sets In Linear and Conic Optimization; R. M. Freund
A Multi-Exchange Heuristic for the Single Source
Capacitated Facility Location Problem; R. K. Ahuja, J. B. Orlin,
S. Pallottino, M. P. Scaparra and M. G. Scutellá
A Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem; R. K. Ahuja, K. Jha , J. B. Orlin and D. Sharma
A Very-Large Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model; R. K. Ahuja, J.Goodstein, A. Mukherjee , J. B. Orlin and D. Sharma
Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A study on the Vehicle Routing Problem; Ö. Ergun, J. B. Orlin and A. Steele-Feldman
Dynamic Shortest Paths Minimizing Travel Times and Costs; R. K. Ahuja, J. B. Orlin, S. Pallottino and M. G. Skutellá
Exact and Heuristic Algorithms for the Weapon Target Assignment Problem; R. K. Ahuja, A. Kumar, K. C. Jha and J. B. Orlin
On the Sum-of-Squares Algorithm for Bin Packing; J. Csirik, D. S. Johnson, C. Kenyon, J. B. Orlin, P.W. Shore and R. W. Weber
Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs; R. Ramaswamy, J.B. Orlin and N. Chakravarti
Solving Real-Life Locomotive Scheduling Problems; R. K. Ahuja, J. Liu, J. B. Orlin, D. Sharma and L.A. Shugart
The Extended Neighborhood: Definition and Characterization; J. B. Orlin and D. Sharma
Concurrent Crasing and Overlapping in Product Development; T. A. Roemer and R. Ahmadi
Exact Distributions of Scaled Multivariate Normal Residuals; G. M. Kaufman
Private Risk; G. M. Kaufman and M. H. Mattar
Last Modified April 15, 2005
Back to MSA Home