Остановите войну!
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 30 matches
- 2002
- Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà:
Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights. Transp. Sci. 36(3): 326-336 (2002) - Andrew P. Armacost, Cynthia Barnhart, Keith A. Ware:
Composite Variable Formulations for Express Shipment Service Network Design. Transp. Sci. 36(1): 1-20 (2002) - K. Ashok, Moshe E. Ben-Akiva:
Estimation and Prediction of Time-Dependent Origin-Destination Flows with a Stochastic Mapping to Path Flows and Link Flows. Transp. Sci. 36(2): 184-198 (2002) - James L. Bander, Chelsea C. White III:
A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost. Transp. Sci. 36(2): 218-230 (2002) - Hillel Bar-Gera:
Origin-Based Algorithm for the Traffic Assignment Problem. Transp. Sci. 36(4): 398-417 (2002) - Jonathan F. Bard, George Kontoravdis, Gang Yu:
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows. Transp. Sci. 36(2): 250-269 (2002) - Cynthia Barnhart, Timothy S. Kniker, Manoj Lohatepanont:
Itinerary-Based Airline Fleet Assignment. Transp. Sci. 36(2): 199-217 (2002) - Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem. Transp. Sci. 36(1): 119-132 (2002) - Luca Bertazzi, Maria Grazia Speranza:
Continuous and Discrete Shipping Strategies for the Single Link Problem. Transp. Sci. 36(3): 314-325 (2002) - David Boyce:
Bibliographic Section. Transp. Sci. 36(1): 144-146 (2002) - Ismaïl Chabini, Alan L. Erera, Andrew P. Armacost, Jon Bottom, Sangjin Han, Martin Joborn, Michael Mahut, Qiang Meng, Andrew Schaefer, Karthik Srinivasan, Huseyin Topaloglu, Shane Velan, Ta-Hui Yang:
Abstracts for the 2001 Transportation Science Section Dissertation Prize Competition. Transp. Sci. 36(1): 133-143 (2002) - Raymond K. Cheung, Chung-Lun Li, Wuqin Lin:
Interblock Crane Deployment in Container Terminals. Transp. Sci. 36(1): 79-93 (2002) - Gregory A. Godfrey, Warren B. Powell:
An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times. Transp. Sci. 36(1): 21-39 (2002) - Gregory A. Godfrey, Warren B. Powell:
An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times. Transp. Sci. 36(1): 40-54 (2002) - Patrick Jaillet, Jonathan F. Bard, Liu Huang, Moshe Dror:
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework. Transp. Sci. 36(3): 292-300 (2002) - Diego Klabjan, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy:
Airline Crew Scheduling with Time Windows and Plane-Count Constraints. Transp. Sci. 36(3): 337-348 (2002) - Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh:
The Stochastic Inventory Routing Problem with Direct Deliveries. Transp. Sci. 36(1): 94-118 (2002) - Michael Z. F. Li, Tae Hoon Oum:
A Note on the Single Leg, Multifare Seat Allocation Problem. Transp. Sci. 36(3): 349-353 (2002) - Ananthapadmanabhan Narasimhan, Udatta S. Palekar:
Analysis and Algorithms for the Transtainer Routing Problem in Container Port Operations. Transp. Sci. 36(1): 63-78 (2002) - Michael Patriksson, R. Tyrrell Rockafellar:
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management. Transp. Sci. 36(3): 271-291 (2002) - Warren B. Powell, Joel A. Shapiro, Hugo P. Simão:
An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem. Transp. Sci. 36(2): 231-249 (2002) - Amelia Regan:
Bibliographic Section. Transp. Sci. 36(3): 354 (2002) - Barbara De Rosa, Gennaro Improta, Gianpaolo Ghiani, Roberto Musmanno:
The Arc Routing and Scheduling Problem with Transshipment. Transp. Sci. 36(3): 301-313 (2002) - Jay M. Rosenberger, Andrew J. Schaefer, David Goldsman, Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser:
A Stochastic Model of Airline Operations. Transp. Sci. 36(4): 357-377 (2002) - Hanif D. Sherali, J. Cole Smith, Antonio A. Trani:
An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations. Transp. Sci. 36(4): 378-397 (2002) - Jiuh-Biing Sheu:
A Stochastic Optimal Control Approach to Real-time, Incident-Responsive Traffic Signal Control at Isolated Intersections. Transp. Sci. 36(4): 418-434 (2002) - Roberto Tadei, Guido Perboli, Federico Della Croce:
A Heuristic Algorithm for the Auto-Carrier Transportation Problem. Transp. Sci. 36(1): 55-62 (2002) - Shane Velan, Michael Florian:
A Note on the Entropy Solutions of the Hydrodynamic Model of Traffic Flow. Transp. Sci. 36(4): 435-446 (2002) - David P. Watling:
A Second Order Stochastic Network Equilibrium Model, I: Theoretical Foundation. Transp. Sci. 36(2): 149-166 (2002) - David P. Watling:
A Second Order Stochastic Network Equilibrium Model, II: Solution Method and Numerical Experiments. Transp. Sci. 36(2): 167-183 (2002)
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-22 23:04 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