Leslie Hall
Adjunct Associate Professor
Department of Mathematical Sciences
Johns Hopkins University
Baltimore, MD 21218
hall@mts.jhu.edu
phone (not reliable): (410)-516-4571
fax: (410)516-7459
Papers and publications
Interesting links related to optimization
Return to JHU Math Sciences Home Page
I am an adjunct faculty member in the Department of Mathematical
Sciences. In September 2001 I resigned my regular position of
Associate Professor in order to spend the bulk of my time with
my family. My research interests are in combinatorial
optimization, including integer and mathematical programming,
scheduling theory, and network design, although currently I am
not doing any research actively. This fall I am teaching
550.666 Combinatorial Optimization.
Education
Ph.D., Operations Research, M.I.T. 1989
Dissertation title: Two topics in discrete optimization:
polyhedral structure of capacitated trees and approximation algorithms
for scheduling.
Advisors:
Thomas L. Magnanti
and
David B. Shmoys.
B.A., Mathematics, Yale University, 1982
I also spent a year in the mathematics department at the
Technische Universitaet Darmstadt (formerly the THD),
Germany, 1983-84.
(photo of Darmstadt)
For abstracts of these publications, click on the title.
Copies of these publications may be obtained by sending me
email or writing to me. Some of them are available electronically,
in postscript format.
-
L.A. Hall, A. Schulz, D.B. Shmoys, and J. Wein,
Scheduling to minimize average completion time: off-line and
on-line approximation algorithms . Mathematics of Operations Research
22, 513-549, 1997.
postscript manuscript
-
M.X. Goemans and L.A. Hall, The strongest
facets of the acyclic subgraph polytope are unknown".
Cunningham, W.H., S.T. McCormick, M. Queyranne, eds.,
Integer Programming and Combinatorial Optimization, Proceedings
of the 5th International IPCO Conference, Lecture Notes in Computer
Science 1084, Springer, 1996.
(Figure: A Paley tournament on eleven vertices)
-
L.A. Hall, D.B. Shmoys, and J. Wein,
Scheduling to minimize weighted completion time: off-line and
on-line algorithms . Extended abstract, July 1995.
Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms
(SODA), 142-151, 1996.
postscript manuscript
-
L.A. Hall, Approximability of flow shop scheduling.
Extended abstract. Proc. of the 36th Symposium on Foundations
of Computer Science (FOCS), 1995.
-
V.A. Strusevich and L.A. Hall,
The open-shop scheduling problem with a non-bottleneck machine .
Submitted to Operations Research Letters .
-
L.A. Hall,
Experience with a cutting plane algorithm for the
capacitated spanning tree problem .
ORSA Journal on Computing , to appear.
-
L.A. Hall,
A polynomial approximation scheme for a constrained
flow-shop scheduling problem .
Mathematics of Operations Research 19 (1994), 68-85.
-
L.A. Hall,
A note on generalizing the maximum lateness criterion for
scheduling .
Discrete Applied Mathematics 47 (1993), 129-137.
-
L.A. Hall and R.J. Vanderbei,
Two-thirds is sharp for affine scaling .
Operations Research Letters 13 (1993), 197-201.
-
J.R. Araque G., L.A. Hall, and T.L. Magnanti,
Capacitated trees, capacitated routing, and associated polyhedra.
-
L.A. Hall and D.B. Shmoys, Near-optimal sequencing
with precedence constraints.
Proc. of the Mathematical Programming Soc. Conference on
Integer Programming and Combinatorial Optimization (IPCO),
May 1990.
-
(more to come, when I have time)
This page was last modified September 2002.