On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Ulrich Huckenbeck
Year of publication: |
1988
|
---|---|
Authors: | Huckenbeck, Ulrich |
Published in: |
Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research. - Heidelberg : Physica-Verl., ISSN 0340-9422, ZDB-ID 246737-9. - Vol. 32.1988, 3/4, p. 187-199
|
Subject: | Netzwerkanalyse | Mathematik | Graphentheorie | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
Saved in:
Saved in favorites
Similar items by subject
-
Approximations for the random minimal spanning tree with application to network provisioning
Jain, Anjani, (1988)
-
Reoptimization procedures for bounded variable primal simplex network algorithms
Ali, A. Iqbal, (1986)
-
Combinatorial optimization : networks and matroids
Lawler, Eugene L., (1976)
- More ...