![](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 30 matches
- 2017
- Bernardetta Addis
, Giuliana Carello
, Sara Mattia:
Survivable green traffic engineering with shared protection. Networks 69(1): 6-22 (2017) - Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia
, Andrea Pacifici
:
Cheapest paths in dynamic networks. Networks 69(1): 23-32 (2017) - Javier Belloso, Angel A. Juan
, Enoc Martínez, Javier Faulin:
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls. Networks 69(3): 241-255 (2017) - Andreas Bley
, Ivana Ljubic
, Olaf Maurer:
A node-based ILP formulation for the node-weighted dominating Steiner problem. Networks 69(1): 33-51 (2017) - Burçin Bozkaya
, F. Sibel Salman, Kaan Telciler:
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations. Networks 69(3): 256-269 (2017) - Olivier Brun, Balakrishna J. Prabhu, Josselin Vallet:
A penalized best-response algorithm for nonlinear single-path routing problems. Networks 69(1): 52-66 (2017) - Christina Büsing, Arie Koster
, Sarah Kirchner, Annika Thome:
The budgeted minimum cost flow problem with unit upgrading cost. Networks 69(1): 67-82 (2017) - Lorenzo Castelli
, Martine Labbé
, Alessia Violin:
Network pricing problem with unit toll. Networks 69(1): 83-93 (2017) - Nicolas Catusse, Victor Chepoi
, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. Networks 69(2): 167-178 (2017) - Stephen R. Chestnut, Rico Zenklusen:
Hardness and approximation for network flow interdiction. Networks 69(4): 378-387 (2017) - Karl F. Doerner, Richard W. Eglese, Richard F. Hartl, Jakob Puchinger
:
Preface: Special issue on the VeRoLog 2015 conference. Networks 69(3): 239-240 (2017) - Nadia Chaabane Fakhfakh, Cyril Briand
, Marie-José Huguet, Alessandro Agnetis:
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game. Networks 69(1): 94-109 (2017) - Bernard Fortz
, Enrico Gorgone, Dimitri Papadimitriou:
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem. Networks 69(1): 110-123 (2017) - Fabio Furini
, Virginie Gabrel, Ian-Christopher Ternier:
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. Networks 69(1): 124-141 (2017) - Martin Josef Geiger
:
On an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015. Networks 69(3): 329-345 (2017) - Luis Eduardo Neves Gouveia
, Michal Pióro
, Jacek Rak
:
Preface: Static and dynamic optimization models for network routing problems. Networks 69(1): 3-5 (2017) - Christian Kloimüllner, Günther R. Raidl:
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition. Networks 69(3): 270-289 (2017) - Thomas Lange, Manja Reinwardt, Peter Tittmann:
A recursive formula for the two-edge connected and biconnected reliability of a complete graph. Networks 69(4): 408-414 (2017) - Oliver Lum, Carmine Cerrone
, Bruce L. Golden, Edward A. Wasil:
Partitioning a street network into compact, balanced, and visually appealing routes. Networks 69(3): 290-303 (2017) - Zhuqi Miao, Balabhaskar Balasundaram
:
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection. Networks 69(4): 388-407 (2017) - Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen
:
Reduced-size formulations for metric and cut polyhedra in sparse graphs. Networks 69(1): 142-150 (2017) - Benjamin Otto, Nils Boysen
:
Zone-based tariff design in public transportation networks. Networks 69(4): 349-366 (2017) - Hanne Pollaris
, Kris Braekers
, An Caris
, Gerrit K. Janssens, Sabine Limbourg:
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. Networks 69(3): 304-316 (2017) - Maria Afshari Rad, Hossein Taghizadeh Kakhki:
Two extended formulations for cardinality maximum flow network interdiction problem. Networks 69(4): 367-377 (2017) - Alexandre Renaud, Nabil Absi
, Dominique Feillet:
The stochastic close-enough arc routing problem. Networks 69(2): 205-221 (2017) - Maciej Rysz, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach. Networks 69(2): 189-204 (2017) - Masahide Saho, Maiko Shigeno:
Cancel-and-tighten algorithm for quickest flow problems. Networks 69(2): 179-188 (2017) - Amaro de Sousa
, Paulo P. Monteiro
, Carlos B. Lopes:
Lightpath admission control and rerouting in dynamic flex-grid optical transport networks. Networks 69(1): 151-163 (2017) - Xinyun Wu
, Zhipeng Lü, Philippe Galinier:
Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks 69(2): 222-236 (2017) - Mesut Yavuz:
An iterated beam search algorithm for the green vehicle routing problem. Networks 69(3): 317-328 (2017)
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-02 17:14 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