Hardness of approximation of the discrete time-cost tradeoff problem
Year of publication: |
2001
|
---|---|
Authors: | Deineko, Vladimir G. ; Woeginger, Gerhard J. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 29.2001, 5, p. 207-210
|
Saved in:
Saved in favorites
Similar items by person
-
A solvable case of the quadratic assignment problem
Deineko, Vladimir G., (1997)
-
Erratum: The Travelling Salesman and the PQ-Tree
Burkard, Rainer E., (1999)
-
The Travelling Salesman and the PQ-Tree
Burkhard, Rainer E., (1998)
- More ...