![](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 25 matches
- 2003
- Ravindra K. Ahuja, James B. Orlin
, Stefano Pallottino, Maria Grazia Scutellà:
Dynamic shortest paths minimizing travel times and costs. Networks 41(4): 197-205 (2003) - Ana Maria de Almeida
, Rosália Rodrigues:
Trees, slices, and wheels: On the floorplan area minimization problem. Networks 41(4): 235-244 (2003) - Igor Averbakh, Oded Berman:
An improved algorithm for the minmax regret median problem on a tree. Networks 41(2): 97-103 (2003) - Jean-Claude Bermond, Stéphan Ceroi:
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks 41(2): 83-86 (2003) - Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41(2): 87-96 (2003) - Felipe C. Calheiros, Abilio Lucena
, Cid C. de Souza
:
Optimal rectangular partitions. Networks 41(1): 51-67 (2003) - Domingos Moreira Cardoso
, Jorge Freire de Sousa
:
A numerical tool for multiattribute ranking problems. Networks 41(4): 229-234 (2003) - Victor Chepoi, Hartmut Noltemeier, Yann Vaxès:
Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003) - João C. N. Clímaco
, José M. F. Craveirinha
, Marta M. B. Pascoal
:
A bicriterion approach for routing problems in multimedia networks. Networks 41(4): 206-220 (2003) - Robert B. Dial:
Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest-path trees. Networks 41(1): 36-43 (2003) - Dalila B. M. M. Fontes
, Eleni Hadjiconstantinou, Nicos Christofides:
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. Networks 41(4): 221-228 (2003) - Christian Fremuth-Paeger, Dieter Jungnickel:
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem. Networks 41(3): 137-142 (2003) - Ian Frommer, Guruprasad Pundoor:
Small-worlds: A review of recent books. Networks 41(3): 174-180 (2003) - Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin
, Eli V. Olinick:
The SONET edge-partition problem. Networks 41(1): 13-23 (2003) - Luis Eduardo Neves Gouveia
, Thomas L. Magnanti:
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3): 159-173 (2003) - Jörg Kalcsics
, Stefan Nickel, Justo Puerto
:
Multifacility ordered median problems on networks: A further analysis. Networks 41(1): 1-12 (2003) - Anna Nagurney:
Report: Some recent developments in network economics. Networks 41(1): 68-72 (2003) - Shmuel Onn
, Elisheva Sperber:
Social network coordination and graph routing. Networks 41(1): 44-50 (2003) - Francisco Ortega, Laurence A. Wolsey:
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3): 143-158 (2003) - José M. P. Paixão, Ernesto de Queirós Vieira Martins, Mário S. Rosa, José Luis E. Dos Santos
:
The determination of the path with minimum-cost norm value. Networks 41(4): 184-196 (2003) - Ján Plesník:
Towards minimum k-geodetically connected graphs. Networks 41(2): 73-82 (2003) - J. Scott Provan:
A polynomial-time algorithm to find shortest paths with recourse. Networks 41(2): 115-125 (2003) - Mauricio G. C. Resende, Celso C. Ribeiro
:
A GRASP with path-relinking for private virtual circuit routing. Networks 41(2): 104-114 (2003) - Mário S. Rosa:
Ernesto de Queirós Vieira Martins (1945-2000): An appreciation. Networks 41(4): 181-183 (2003) - Haldun Süral
, James H. Bookbinder:
The single-vehicle routing problem with unrestricted backhauls. Networks 41(3): 127-136 (2003)
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-06-26 01:20 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