The complexity of cover inequality separation
Year of publication: |
1998
|
---|---|
Authors: | Klabjan, D. ; Nemhauser, G.L. ; Tovey, C. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 23.1998, 1, p. 35-40
|
Saved in:
Saved in favorites
Similar items by person
-
An analysis of approximations for maximizing submodular set functions
FISHER, M.L.,
-
Best algorithms for approximating the maximum of a submodular set function
NEMHAUSER, G.L.,
-
Production scheduling in almost continuous time
Gue, K.R., (1997)
- More ...