


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 35 matches
- 2011
- Niels A. H. Agatz, Ann Melissa Campbell
, Moritz Fleischmann, Martin W. P. Savelsbergh
:
Time Slot Management in Attended Home Delivery. Transp. Sci. 45(3): 435-449 (2011) - Jardar Andersen
, Marielle Christiansen, Teodor Gabriel Crainic
, Roar Grønhaug:
Branch and Price for Service Network Design with Asset Management Constraints. Transp. Sci. 45(1): 33-49 (2011) - Claudia Archetti
, Mathieu Bouchard, Guy Desaulniers
:
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. Transp. Sci. 45(3): 285-298 (2011) - Tolga Bektas
, Günes Erdogan
, Stefan Ropke
:
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem. Transp. Sci. 45(3): 299-316 (2011) - Thierry Benoist, Frédéric Gardi, Antoine Jeanjean, Bertrand Estellon:
Randomized Local Search for Real-Life Inventory Routing. Transp. Sci. 45(3): 381-398 (2011) - Gerardo Berbeglia
, Gilles Pesant, Louis-Martin Rousseau:
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming. Transp. Sci. 45(3): 399-412 (2011) - Nils Boysen
, Florian Jaehn, Erwin Pesch:
Scheduling Freight Trains in Rail-Rail Transshipment Yards. Transp. Sci. 45(2): 199-211 (2011) - Gabrio Caimi, Fabián A. Chudak, Martin Fuchsberger, Marco Laumanns
, Rico Zenklusen:
A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling. Transp. Sci. 45(2): 212-227 (2011) - Paola Cappanera
, Maria Paola Scaparra:
Optimal Allocation of Protective Resources in Shortest-Path Networks. Transp. Sci. 45(1): 64-80 (2011) - Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. Transp. Sci. 45(2): 246-257 (2011) - Alberto Caprara, Enrico Malaguti, Paolo Toth:
A Freight Service Design Problem for a Railway Corridor. Transp. Sci. 45(2): 147-162 (2011) - Elisabetta Cherchi, Juan de Dios Ortúzar
:
On the Use of Mixed RP/SP Models in Prediction: Accounting for Systematic and Random Taste Heterogeneity. Transp. Sci. 45(1): 98-108 (2011) - Joseph Y. J. Chow, Amelia Regan
:
Real Option Pricing of Network Design Investments. Transp. Sci. 45(1): 50-63 (2011) - Iván A. Contreras
, Jean-François Cordeau, Gilbert Laporte:
The Dynamic Uncapacitated Hub Location Problem. Transp. Sci. 45(1): 18-32 (2011) - Angel Corberán
, Elena Fernández
, Carles Franquesa, José María Sanchis
:
The Windy Clustered Prize-Collecting Arc-Routing Problem. Transp. Sci. 45(3): 317-334 (2011) - Gunnar Flötteröd
, Michel Bierlaire
, Kai Nagel
:
Bayesian Demand Calibration for Dynamic Traffic Simulations. Transp. Sci. 45(4): 541-561 (2011) - Russell D. Halper, S. Raghavan:
The Mobile Facility Routing Problem. Transp. Sci. 45(3): 413-434 (2011) - Steven Harrod
:
Modeling Network Transition Constraints with Hypergraphs. Transp. Sci. 45(1): 81-97 (2011) - Raphaèle Herbin, Ludovic Leclercq
:
"A Note on the Entropy Solutions of the Hydrodynamic Model of Traffic Flow" Revisited. Transp. Sci. 45(1): 138-142 (2011) - Lori Houghtalen
, Özlem Ergun, Joel S. Sokol
:
Designing Mechanisms for the Management of Carrier Alliances. Transp. Sci. 45(4): 465-482 (2011) - Zhe Liang, Wanpracha Art Chaovalitwongse, Huei Chuen Huang, Ellis L. Johnson:
On a New Rotation Tour Network Model for Aircraft Maintenance Routing Problem. Transp. Sci. 45(1): 109-120 (2011) - Shi Qiang Liu, Erhan Kozan
:
Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model. Transp. Sci. 45(2): 175-198 (2011) - Richard Lusby
, Jesper Larsen
, David M. Ryan, Matthias Ehrgott
:
Routing Trains Through Railway Junctions: A New Set-Packing Approach. Transp. Sci. 45(2): 228-245 (2011) - Jorge E. Mendoza
, Bruno Castanier
, Christelle Guéret
, Andrés L. Medaglia
, Nubia Velasco
:
Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 45(3): 346-363 (2011) - Rahul Nair, Elise Miller-Hooks:
Fleet Management for Vehicle Sharing Operations. Transp. Sci. 45(4): 524-540 (2011) - Okan Örsan Özener, Özlem Ergun, Martin W. P. Savelsbergh
:
Lane-Exchange Mechanisms for Truckload Carrier Collaboration. Transp. Sci. 45(1): 1-17 (2011) - Guido Perboli
, Roberto Tadei
, Daniele Vigo
:
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics. Transp. Sci. 45(3): 364-380 (2011) - Hanif D. Sherali, Justin M. Hill, Michael V. McCrea, Antonio A. Trani:
Integrating Slot Exchange, Safety, Capacity, and Equity Mechanisms Within an Airspace Flow Program. Transp. Sci. 45(2): 271-284 (2011) - Milind G. Sohoni
, Yu-Ching Lee
, Diego Klabjan:
Robust Airline Scheduling Under Block-Time Uncertainty. Transp. Sci. 45(4): 451-464 (2011) - Oguz Solyali
, Haldun Süral
:
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem. Transp. Sci. 45(3): 335-345 (2011)
skipping 5 more matches
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 2025-03-11 14:08 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