Complexity of a scheduling problem with controllable processing times
Year of publication: |
2010
|
---|---|
Authors: | Asadi, A. ; Gu, G. ; Roos, C. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 38.2010, 2, p. 123-127
|
Saved in:
Saved in favorites
Similar items by person
-
Convergence of the homotopy path for a full-Newton step infeasible interior-point method
Asadi, A., (2010)
-
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Gu, G., (2011)
-
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Gu, G., (2011)
- More ...