![](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 29 matches
- 2007
- Filipe Pereira Alvelos
, José M. Valério de Carvalho
:
An extended model and a column generation algorithm for the planar multicommodity flow problem. Networks 50(1): 3-16 (2007) - Katerina Asdre, Stavros D. Nikolopoulos:
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. Networks 50(4): 231-240 (2007) - Alper Atamtürk, Oktay Günlük
:
Network design arc set with variable upper bounds. Networks 50(1): 17-28 (2007) - Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Preface. Networks 50(1): 1-2 (2007) - Oded Berman, Jiamin Wang:
The 1-minimax and 1-maximin problems with demand weights of general probability distributions. Networks 50(2): 127-135 (2007) - Andreas Bley
:
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths. Networks 50(1): 29-36 (2007) - Mustapha Bouhtou, Guillaume Erbs, Michel Minoux:
Joint optimization of pricing and resource allocation in competitive telecommunications networks. Networks 50(1): 37-49 (2007) - Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà:
Hardness of robust network design. Networks 50(1): 50-54 (2007) - Eddie Cheng
, László Lipták:
Matching preclusion for some interconnection networks. Networks 50(2): 173-180 (2007) - Alexandre Salles da Cunha, Abilio Lucena
:
Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks 50(1): 55-66 (2007) - Geir Dahl
:
Majorization and distances in trees. Networks 50(4): 251-257 (2007) - Donglei Du
, R. Chandrasekaran:
The maximum residual flow problem: NP-hardness with two-arc destruction. Networks 50(3): 181-182 (2007) - Toni R. Farley, Charles J. Colbourn:
Multiterminal resilience for series-parallel networks. Networks 50(2): 164-172 (2007) - Dalila B. M. M. Fontes
, José Fernando Gonçalves
:
Heuristic solutions for general concave minimum cost network flow problems. Networks 50(1): 67-76 (2007) - José Gómez:
Large vertex symmetric digraphs. Networks 50(4): 241-250 (2007) - Jeff Hartline, Alexa Sharp:
Incremental flow. Networks 50(1): 77-85 (2007) - Hovhannes A. Harutyunyan, Calin D. Morosan:
On the minimum path problem in Knödel graphs. Networks 50(1): 86-91 (2007) - Hipólito Hernández-Pérez
, Juan José Salazar González
:
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks 50(4): 258-272 (2007) - Sung-Pil Hong, Byung-Cheon Choi
:
Approximability of the k-server disconnection problem. Networks 50(4): 273-282 (2007) - Gilbert Laporte, Inmaculada Rodríguez Martín
:
Locating a cycle in a transportation or a telecommunications network. Networks 50(1): 92-108 (2007) - Benoit Lardeux, Dritan Nace, Jérôme Geffard:
Multiperiod network design with incremental routing. Networks 50(1): 109-117 (2007) - Jing-Quan Li, Pitu B. Mirchandani, Denis Borenstein
:
The vehicle rescheduling problem: Model and algorithms. Networks 50(3): 211-229 (2007) - Guizhen Liu, Jianfeng Hou, Jiansheng Cai:
Some results about f-critical graphs. Networks 50(3): 197-202 (2007) - Fernando Ordóñez
, Jiamin Zhao:
Robust capacity expansion of network flows. Networks 50(2): 136-145 (2007) - B. S. Panda, Anita Das:
On tree 3-spanners in directed path graphs. Networks 50(3): 203-210 (2007) - Ning Shi, Raymond K. Cheung, Haiqing Song:
On stochastic programs over trees with partially dependent arc capacities. Networks 50(2): 157-163 (2007) - Karen R. Smilowitz, Carlos F. Daganzo:
Continuum approximation techniques for the design of integrated package distribution systems. Networks 50(3): 183-196 (2007) - Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu:
Panpositionable hamiltonicity of the alternating group graphs. Networks 50(2): 146-156 (2007) - Guang Xu, Yang Yang, Jinhui Xu:
Linear time algorithms for approximating the facility terminal cover problem. Networks 50(1): 118-126 (2007)
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-07-03 01:16 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