Leslie A. Hall

Available identifiers

Publication	Date of Publication	Type
The strongest facets of the acyclic subgraph polytope are unknown	2019-01-11	Paper
Multistars and directed flow formulations	2003-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4231913	2000-04-26	Paper
Approximability of flow shop scheduling	1999-06-03	Paper
Short Shop Schedules	1998-07-06	Paper
An open shop scheduling problem with a non-bottleneck machine	1997-11-06	Paper
Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms	1997-10-28	Paper
Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem	1997-10-09	Paper
https://portal.mardi4nfdi.de/entity/Q4875178	1996-04-28	Paper
A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem	1995-09-27	Paper
Two-thirds is sharp for affine scaling	1994-08-31	Paper
A note on generalizing the maximum lateness criterion for scheduling	1994-03-17	Paper
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better	1993-01-16	Paper
A Polyhedral Intersection Theorem for Capacitated Spanning Trees	1993-01-16	Paper

This page was built for person: Leslie A. Hall