default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 33
Volume 33, Number 1, January 1991
- Charles J. Colbourn:
Combinatorial aspects of network reliability. 1-15 - Bezalel Gavish:
Topological design of telecommunication networks-local access design methods. 17-71 - Frank K. Hwang:
A primer of the Euclidean Steiner problem. 73-84
Volume 33, Number 2, February 1991
- Charles J. Colbourn:
Network reliability: Numbers or insight? - A discussion paper. 85-93 - Peter Kubat:
Alternatives for reliable and quality telecommunication network design. 95-105 - D. H. Smith:
Optimally reliable networks. 107-112 - J. Luis A. Yebra, Victor J. Rayward-Smith, A. P. Revitt:
The (Δ, d, d′, Δ - 1)-problem with applications to computer networks. 113-124
Volume 33, Number 3, March 1991
- Richard B. Borie, R. Gary Parker, Craig A. Tovey
:
Algorithms for recognition of regular properties and decomposition of recursive graph families. 125-149 - Endre Boros, Peter L. Hammer:
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. 151-180 - Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
The image of weighted combinatorial problems. 181-197 - Chung-Kuan Cheng, T. C. Hu:
Ancestor tree for arbitrary multi-terminal cut functions. 199-213 - Refael Hassin:
Multiterminal xcut problems. 215-225 - Wiktor Piotrowski, Maciej M. Syslo:
Some properties of graph centroids. 227-236
Volume 33, Number 4, April 1991
- Anantaram Balakrishnan, Thomas L. Magnanti, A. Shulman, Richard T. Wong:
Models for planning capacity expansion in local access telecommunication networks. 237-284 - Choaib Bousba, Laurence A. Wolsey:
Finding minimum cost directed trees with demands and capacities. 285-303 - Luis Eduardo Neves Gouveia, José Pinto Paixão:
Dynamic programming based heuristics for the topological design of local access networks. 305-327
Volume 33, Number 5, May 1991
- Jens Clausen, Jesper Larsson Träff:
Implementation of parallel branch-and-bound algorithms - experiences with the graph partitioning problem. 329-349 - Fred W. Glover, Micheal Lee, Jennifer Ryan:
Least-cost network topology design for a new service - An application of tabu search. 351-362 - Eugene L. Lawler:
Computing shortest paths in networks derived from recurrence relations. 363-377 - Geoff P. McKeown, Victor J. Rayward-Smith, Heather Jane Turpin:
Branch-and-bound as a higher-order function. 379-402
Volume 33, Number 6, June 1991
- Marshall W. Bern, Daniel Bienstock:
Polynomially solvable special cases of the Steiner problem in planar networks. 403-418 - R. S. Booth:
The steiner ratio for five points. 419-436 - Ding-Zhu Du:
On steiner ratio conjectures. 437-449 - Cees Duin, Ton Volgenant:
The multi-weighted Steiner tree problem. 451-469 - Nelson Maculan, Paulo Souza, Alfredo Candia-Véjar:
An approach for the Steiner problem in directed graphs. 471-480 - J. Hyam Rubinstein, Doreen A. Thomas:
A variational approach to the Steiner network problem. 481-499
Volume 33, Number 7, July 1991
- John Dolan, Richard S. Weiss, J. MacGregor Smith:
Minimal length tree networks on the unit sphere. 501-535 - J. Scott Provan:
The role of Steiner hulls in the solution to Steiner tree problems. 537-548 - Dana S. Richards, Jeffrey S. Salowe:
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. 549-556 - Peter Widmayer:
On graphs preserving rectilinear shortest paths in the presence of obstacles. 557-575 - Pawel Winter, J. MacGregor Smith:
Steiner minimal trees for three points with one convex polygonal obstacle. 577-599
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-05 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
