Linear time algorithms for some separable quadratic programming problems
Year of publication: |
1993
|
---|---|
Authors: | Megiddo, N. ; Tamir, A. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 13.1993, 4, p. 203-212
|
Saved in:
Saved in favorites
Similar items by person
-
An O(n log2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
Megiddo, N., (1979)
-
Finding Mixed Strategies with Small Supports in Extensive Form Games
Koller, D., (1996)
-
An O(n log2 n) Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
Megiddo, N., (1979)
- More ...