Leslie A. Hall

14 papers A* 3B 2Journal 9
YearRankTypeTitle / Venue / Authors
2002 J jnl
Multistars and directed flow formulations.
Networks
Luis Eduardo Neves Gouveia, Leslie A. Hall
1998 J jnl
Approximability of flow shop scheduling.
Math. Program.
Leslie A. Hall
1997 J jnl
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms.
Math. Oper. Res.
Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein
1997 J jnl
Short Shop Schedules.
Oper. Res.
David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys
1996 A* conf
Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms.
SODA
Leslie A. Hall, David B. Shmoys, Joel Wein
1996 B conf
The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown.
IPCO
Michel X. Goemans, Leslie A. Hall
1995 A* conf
Approximability of Flow Shop Scheduling.
FOCS
Leslie A. Hall
1994 J jnl
A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem.
Math. Oper. Res.
Leslie A. Hall
1993 J jnl
A Note on Generalizing the Maximum Lateness Criterion for Scheduling.
Discret. Appl. Math.
Leslie A. Hall
1993 J jnl
Two-thirds is sharp for affine scaling.
Oper. Res. Lett.
Leslie A. Hall, Robert J. Vanderbei
1992 J jnl
A Polyhedral Intersection Theorem for Capacitated Spanning Trees.
Math. Oper. Res.
Leslie A. Hall, Thomas L. Magnanti
1992 J jnl
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better.
Math. Oper. Res.
Leslie A. Hall, David B. Shmoys
1990 B conf
Near-Optimal Sequencing with Precedence Constraints.
IPCO
Leslie A. Hall, David B. Shmoys
1989 A* conf
Approximation Schemes for Constrained Scheduling Problems
FOCS
Leslie A. Hall, David B. Shmoys