Остановите войну!
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 27 matches
- 2015
- Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser:
Stochastic maximum weight forest problem. Networks 65(4): 289-305 (2015) - Ashwin Arulselvan, Olaf Maurer, Martin Skutella:
An incremental algorithm for the uncapacitated facility location problem. Networks 65(4): 306-311 (2015) - Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey:
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. Networks 65(2): 129-138 (2015) - Thais Ávila, Angel Corberán, Isaac Plana, José María Sanchis:
The stacker crane problem and the directed general routing problem. Networks 65(1): 43-55 (2015) - Maria Battarra, Richard W. Eglese, Günes Erdogan:
Guest editorial: Recent trends in vehicle routing. Networks 65(2): 101 (2015) - Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
Efficient algorithms for the maximum concurrent flow problem. Networks 65(1): 56-67 (2015) - Tolga Bektas, Jens Lysgaard:
Optimal vehicle routing with lower and upper bounds on route durations. Networks 65(2): 166-179 (2015) - Michael Bögl, Karl F. Doerner, Sophie N. Parragh:
The school bus routing and scheduling problem with transfers. Networks 65(2): 180-203 (2015) - Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat:
Network spot-checking games: Theory and application to toll enforcing in transportation networks. Networks 65(4): 312-328 (2015) - Claudio Contardo, Guy Desaulniers, François Lessard:
Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks 65(1): 88-99 (2015) - Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron:
Formulations and exact solution approaches for the degree preserving spanning tree problem. Networks 65(4): 329-343 (2015) - Andrea D'Ariano, Dario Pacciarelli, Marco Pistelli, Marco Pranzo:
Real-time scheduling of aircraft arrivals and departures in a terminal maneuvering area. Networks 65(3): 212-227 (2015) - Yuanyuan Dong, Eli V. Olinick, T. Jason Kratz, David W. Matula:
A compact linear programming formulation of the maximum concurrent flow problem. Networks 65(1): 68-87 (2015) - Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
On the complexity of equal shortest path routing. Networks 65(4): 344-352 (2015) - Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring:
Computing network tolls with support constraints. Networks 65(3): 262-285 (2015) - Jörg Kalcsics, Stefan Nickel, Justo Puerto, Antonio M. Rodríguez-Chía:
Several 2-facility location problems on networks with equity objectives. Networks 65(1): 1-9 (2015) - Ekkehard Köhler, Martin Strehler:
Traffic signal optimization using cyclically expanded networks. Networks 65(3): 244-261 (2015) - Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
A branch-and-price algorithm for the (k, c)-coloring problem. Networks 65(4): 353-366 (2015) - Daniele Manerba, Renata Mansini:
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2): 139-154 (2015) - Nikola Markovic, Ilya O. Ryzhov, Paul M. Schonfeld:
Evasive flow capture: Optimal location of weigh-in-motion systems, tollbooths, and security checkpoints. Networks 65(1): 22-42 (2015) - Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. Networks 65(4): 367-379 (2015) - S. Raghavan, Mustafa Sahin:
Efficient Edge-swapping heuristics for the reload cost spanning tree problem. Networks 65(4): 380-394 (2015) - Ana Maria Rodrigues, José Soeiro Ferreira:
Waste collection routing - limited multiple landfills and heterogeneous fleet. Networks 65(2): 155-165 (2015) - Jesús Sánchez-Oro, Manuel Laguna, Abraham Duarte, Rafael Martí:
Scatter search for the profile minimization problem. Networks 65(1): 10-21 (2015) - Marie Schmidt, Anita Schöbel:
The complexity of integrating passenger routing decisions in public transportation models. Networks 65(3): 228-243 (2015) - Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, Christian Prins:
Timing problems and algorithms: Time decisions for sequences of activities. Networks 65(2): 102-128 (2015) - Bang Ye Wu, Hung-Lung Wang:
The next-to-shortest path problem on directed graphs with positive edge weights. Networks 65(3): 205-211 (2015)
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-06-04 04:45 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