An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
Year of publication: |
2005
|
---|---|
Authors: | Savelsbergh, Martin W.P. ; Uma, R.N. ; Wein, Joel |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 17.2005, 1, p. 123
|
Saved in:
Saved in favorites
Similar items by person
-
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
Hall, Leslie A., (1997)
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
- More ...