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 15 matches
- 2010
- Marcus Poggi de Aragão, Henrique Viana, Eduardo Uchoa:
The Team Orienteering Problem: Formulations and Branch-Cut and Price. ATMOS 2010: 142-155 - Ralf Borndörfer, Thomas Schlechte, Steffen Weider:
Railway Track Allocation by Rapid Branching. ATMOS 2010: 13-23 - Alberto Caprara:
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation. ATMOS 2010: 1-12 - Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Robust Train Routing and Online Re-scheduling. ATMOS 2010: 24-33 - Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen:
Heuristics for the Traveling Repairman Problem with Profits. ATMOS 2010: 34-44 - Thomas Erlebach, Marco E. Lübbecke:
Frontmatter, Table of Contents, Preface, Organization. ATMOS 2010 - Frank Fischer, Christoph Helmberg:
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling. ATMOS 2010: 45-60 - Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych:
Vertex Disjoint Paths for Dispatching in Railways. ATMOS 2010: 61-73 - Robert Geisberger, Dennis Luxen, Sabine Neubauer, Peter Sanders, Lars Völker:
Fast Detour Computation for Ride Sharing. ATMOS 2010: 88-99 - Robert Geisberger, Peter Sanders:
Engineering Time-Dependent Many-to-Many Shortest Paths Computation. ATMOS 2010: 74-87 - Marc Goerigk, Anita Schöbel:
An Empirical Analysis of Robustness Concepts for Timetabling. ATMOS 2010: 100-113 - Ekkehard Köhler, Martin Strehler:
Traffic Signal Optimization Using Cyclically Expanded Networks. ATMOS 2010: 114-129 - Sébastien Lannez, Christian Artigues, Jean Damay, Michel Gendreau:
Column Generation Heuristic for a Rich Arc Routing Problem. ATMOS 2010: 130-141 - Marie Schmidt, Anita Schöbel:
The Complexity of Integrating Routing Decisions in Public Transportation Models. ATMOS 2010: 156-169 - Thomas Erlebach, Marco E. Lübbecke:
ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010. OASIcs 14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2010 [contents]
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-11-04 13:14 CET 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