![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 31 matches
- 1991
- Anantaram Balakrishnan, Thomas L. Magnanti, A. Shulman, Richard T. Wong
:
Models for planning capacity expansion in local access telecommunication networks. Ann. Oper. Res. 33(4): 237-284 (1991) - Marshall W. Bern, Daniel Bienstock:
Polynomially solvable special cases of the Steiner problem in planar networks. Ann. Oper. Res. 33(6): 403-418 (1991) - R. S. Booth:
The steiner ratio for five points. Ann. Oper. Res. 33(6): 419-436 (1991) - Richard B. Borie, R. Gary Parker, Craig A. Tovey
:
Algorithms for recognition of regular properties and decomposition of recursive graph families. Ann. Oper. Res. 33(3): 125-149 (1991) - Endre Boros, Peter L. Hammer:
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33(3): 151-180 (1991) - Choaib Bousba, Laurence A. Wolsey:
Finding minimum cost directed trees with demands and capacities. Ann. Oper. Res. 33(4): 285-303 (1991) - Paolo M. Camerini, Giulia Galbiati, Francesco Maffioli:
The image of weighted combinatorial problems. Ann. Oper. Res. 33(3): 181-197 (1991) - Chung-Kuan Cheng, T. C. Hu:
Ancestor tree for arbitrary multi-terminal cut functions. Ann. Oper. Res. 33(3): 199-213 (1991) - Jens Clausen, Jesper Larsson Träff:
Implementation of parallel branch-and-bound algorithms - experiences with the graph partitioning problem. Ann. Oper. Res. 33(5): 329-349 (1991) - Charles J. Colbourn:
Combinatorial aspects of network reliability. Ann. Oper. Res. 33(1): 1-15 (1991) - Charles J. Colbourn:
Network reliability: Numbers or insight? - A discussion paper. Ann. Oper. Res. 33(2): 85-93 (1991) - John Dolan, Richard S. Weiss, J. MacGregor Smith:
Minimal length tree networks on the unit sphere. Ann. Oper. Res. 33(7): 501-535 (1991) - Ding-Zhu Du:
On steiner ratio conjectures. Ann. Oper. Res. 33(6): 437-449 (1991) - Cees Duin, Ton Volgenant:
The multi-weighted Steiner tree problem. Ann. Oper. Res. 33(6): 451-469 (1991) - Bezalel Gavish:
Topological design of telecommunication networks-local access design methods. Ann. Oper. Res. 33(1): 17-71 (1991) - Fred W. Glover, Micheal Lee, Jennifer Ryan:
Least-cost network topology design for a new service - An application of tabu search. Ann. Oper. Res. 33(5): 351-362 (1991) - Luis Eduardo Neves Gouveia
, José Pinto Paixão
:
Dynamic programming based heuristics for the topological design of local access networks. Ann. Oper. Res. 33(4): 305-327 (1991) - Refael Hassin:
Multiterminal xcut problems. Ann. Oper. Res. 33(3): 215-225 (1991) - Frank K. Hwang:
A primer of the Euclidean Steiner problem. Ann. Oper. Res. 33(1): 73-84 (1991) - Peter Kubat:
Alternatives for reliable and quality telecommunication network design. Ann. Oper. Res. 33(2): 95-105 (1991) - Eugene L. Lawler:
Computing shortest paths in networks derived from recurrence relations. Ann. Oper. Res. 33(5): 363-377 (1991) - Nelson Maculan, Paulo Souza, Alfredo Candia-Véjar
:
An approach for the Steiner problem in directed graphs. Ann. Oper. Res. 33(6): 471-480 (1991) - Geoff P. McKeown, Victor J. Rayward-Smith, Heather Jane Turpin:
Branch-and-bound as a higher-order function. Ann. Oper. Res. 33(5): 379-402 (1991) - Wiktor Piotrowski, Maciej M. Syslo:
Some properties of graph centroids. Ann. Oper. Res. 33(3): 227-236 (1991) - J. Scott Provan:
The role of Steiner hulls in the solution to Steiner tree problems. Ann. Oper. Res. 33(7): 537-548 (1991) - Dana S. Richards, Jeffrey S. Salowe:
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. Ann. Oper. Res. 33(7): 549-556 (1991) - J. Hyam Rubinstein
, Doreen A. Thomas
:
A variational approach to the Steiner network problem. Ann. Oper. Res. 33(6): 481-499 (1991) - D. H. Smith:
Optimally reliable networks. Ann. Oper. Res. 33(2): 107-112 (1991) - Peter Widmayer:
On graphs preserving rectilinear shortest paths in the presence of obstacles. Ann. Oper. Res. 33(7): 557-575 (1991) - Pawel Winter, J. MacGregor Smith:
Steiner minimal trees for three points with one convex polygonal obstacle. Ann. Oper. Res. 33(7): 577-599 (1991)
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-26 12:22 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint