Остановите войну!
for scientists:
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 28 matches
- 2009
- Yogesh Kumar Agarwal:
Polyhedral structure of the 4-node network design problem. Networks 54(3): 139-149 (2009) - Egon Balas, Rüdiger Stephan:
On the cycle polytope of a directed graph and its relaxations. Networks 54(1): 47-55 (2009) - Roberto Baldacci, Maria Battarra, Daniele Vigo:
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. Networks 54(4): 178-189 (2009) - Douglas Bauer, S. Louis Hakimi, Nathan Kahl, Edward F. Schmeichel:
Sufficient degree conditions for k-edge-connectedness of a graph. Networks 54(2): 95-98 (2009) - Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis:
Min-Max K-vehicles windy rural postman problem. Networks 54(4): 216-226 (2009) - Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin:
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1): 56-67 (2009) - Andreas Bley:
Approximability of unsplittable shortest path routing problems. Networks 54(1): 23-46 (2009) - Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo:
A generalization of an edge-connectivity theorem of Chartrand. Networks 54(2): 82-89 (2009) - Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
A survey of some network reliability analysis and synthesis results. Networks 54(2): 99-107 (2009) - Jason I. Brown, Karl Dilcher:
On the roots of strongly connected reliability polynomials. Networks 54(2): 108-116 (2009) - Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, Ping Zhang:
The rainbow connectivity of a graph. Networks 54(2): 75-81 (2009) - Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir:
Minimax flow tree problems. Networks 54(3): 117-129 (2009) - Alan L. Erera, Martin W. P. Savelsbergh:
ROUTE 2007: Recent advances in vehicle routing optimization. Networks 54(4): 165-166 (2009) - Alan L. Erera, Martin W. P. Savelsbergh, Emrah Uyar:
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4): 270-283 (2009) - Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra:
On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1): 12-19 (2009) - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. Networks 54(3): 130-138 (2009) - Chris Groër, Bruce L. Golden, Edward A. Wasil:
The balanced billing cycle vehicle routing problem. Networks 54(4): 243-254 (2009) - Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper coloring of unit disk graphs. Networks 54(3): 150-164 (2009) - Sun-Yuan Hsieh, Tsong-Jie Lin:
Panconnectivity and edge-pancyclicity of k-ary n-cubes. Networks 54(1): 1-11 (2009) - Yuichi Nagata, Olli Bräysy:
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54(4): 205-215 (2009) - Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl, Xavier Gandibleux:
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks 54(4): 227-242 (2009) - Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão:
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54(4): 167-177 (2009) - Louis Petingi, M. Talafha:
Packing the Steiner trees of a graph. Networks 54(2): 90-94 (2009) - Eric Prescott-Gagnon, Guy Desaulniers, Louis-Martin Rousseau:
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4): 190-204 (2009) - Zhihong Shen, Maged M. Dessouky, Fernando Ordóñez:
A two-stage vehicle routing model for large-scale bioterrorism emergencies. Networks 54(4): 255-269 (2009) - Peter J. Slater:
Liar's domination. Networks 54(2): 70-74 (2009) - Charles L. Suffel:
A eulogy for Frank Boesch. Networks 54(2): 69 (2009) - Yuuki Tanaka, Yukio Shibata:
A note on the k-degree Cayley graph. Networks 54(1): 20-22 (2009)
loading more results
failed to load more results, please try again later
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-05-30 06:36 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