Approximations for the random minimal spanning tree with application to network provisioning
| Year of publication: |
1988
|
|---|---|
| Authors: | Jain, Anjani ; Mamer, John W. |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 36.1988, 4, p. 575-584
|
| Subject: | Netzwerkanalyse | Mathematik | Graphentheorie | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich, (1988)
-
Ruhe, G., (1988)
-
Facilities layout generalized model solved by n-boundary shortest path heuristics
Giffin, J. W., (1987)
- More ...
-
Occupational structure and the industrialization of agriculture
Mamer, John W., (1984)
-
Discounted and per unit costs of product warranty
Mamer, John W., (1987)
-
Competitive Equilibrium in an Exchange Economy with Indivisibilities
Bikhchandani, Sushil, (1997)
- More ...