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 31 matches
- 1988
- Turgut Aykin:
On the Location of Hub Facilities. Transp. Sci. 22(2): 155-157 (1988) - Rajan Batta:
Single Server Queueing-Location Models with Rejection. Transp. Sci. 22(3): 209-216 (1988) - Oded Berman, David Simchi-Levi:
Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers. Transp. Sci. 22(2): 148-154 (1988) - Dimitris Bertsimas, Xenophon Papaconstantinou:
On the Steady-State Solution of the M/C2(a, b)/s Queueing System. Transp. Sci. 22(2): 125-138 (1988) - Margaret L. Brandeau, Samuel S. Chiu:
Parametric Facility Location on a Tree Network with an Lp-Norm Cost Function. Transp. Sci. 22(1): 59-69 (1988) - Margaret L. Brandeau, Samuel S. Chiu:
Establishing Continuity of Certain Optimal Parametric Facility Location Trajectories. Transp. Sci. 22(3): 224-225 (1988) - Reuven Chen:
Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space. Transp. Sci. 22(2): 157-160 (1988) - M.-L. Chen, Richard L. Francis, Timothy J. Lowe:
The 1-Center Problem: Exploiting Block Structure. Transp. Sci. 22(4): 259-269 (1988) - John R. Current:
The Design of a Hierarchical Transportation Network with Transshipment Facilities. Transp. Sci. 22(4): 270-277 (1988) - Mark S. Daskin, Leonard Evans, Randolph W. Hall, Charles E. M. Pearce, Gordon F. Newell:
Bibliographic Section. Transp. Sci. 22(4): 289-293 (1988) - Erhan Erkut, Richard L. Francis, Timothy J. Lowe:
Locating Two Facilities on a Tree Subject to Distance Constraints. Transp. Sci. 22(3): 199-208 (1988) - John Flynn, Samuel Ratick:
A Multiobjective Hierarchical Covering Model for the Essential Air Services Program. Transp. Sci. 22(2): 139-147 (1988) - Betsy S. Greenberg, Robert C. Leachman, Ronald W. Wolff:
Predicting Dispatching Delays on a Low Speed, Single Track Railroad. Transp. Sci. 22(1): 31-38 (1988) - Pierre Hansen, Martine Labbé:
Algorithms for Voting and Competitive Location on a Network. Transp. Sci. 22(4): 278-288 (1988) - Patrick T. Harker:
Multiple Equilibrium Behaviors on Networks. Transp. Sci. 22(1): 39-46 (1988) - Patrick T. Harker:
Private Market Participation in Urban Mass Transportation: Application of Computable Equilibrium Models of Network Competition. Transp. Sci. 22(2): 96-111 (1988) - Gilbert Laporte, Yves Nobert, Serge Taillefer:
Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems. Transp. Sci. 22(3): 161-172 (1988) - Richard C. Larson:
Transporting Sludge to the 106-Mile Site: An Inventory/Routing Model for Fleet Sizing and Logistics System Design. Transp. Sci. 22(3): 186-198 (1988) - Patrice Marcotte, Jacques Guélat:
Adaptation of a Modified Newton Method for Solving the Asymmetric Traffic Equilibrium Problem. Transp. Sci. 22(2): 112-124 (1988) - Emanuel Melachrinoudis:
An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem. Transp. Sci. 22(3): 217-223 (1988) - Eric J. Miller, Philip D. Patterson, Lidia P. Kostyniuk, Philip A. Viton, Alex Anas:
Bibliographic Section. Transp. Sci. 22(1): 74-81 (1988) - Gordon F. Newell:
Traffic Flow for the Morning Commute. Transp. Sci. 22(1): 47-58 (1988) - Bhagwant Persaud, Van Olin Hurdle:
Freeway Traffic Data from Time-Lapse Film. Transp. Sci. 22(4): 251-258 (1988) - E. R. Petersen, Allison James Taylor:
An Optimal Scheduling System for the Welland Canal. Transp. Sci. 22(3): 173-185 (1988) - Krishan Rana, Raymond G. Vickson:
A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership. Transp. Sci. 22(2): 83-95 (1988) - K. Nabil Ali Safwat, Thomas L. Magnanti:
A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model. Transp. Sci. 22(1): 14-30 (1988) - Hanif D. Sherali, Frederick L. Nordai:
A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands. Transp. Sci. 22(1): 70-73 (1988) - Marius M. Solomon, Jacques Desrosiers:
Survey Paper - Time Window Constrained Routing and Scheduling Problems. Transp. Sci. 22(1): 1-13 (1988) - Richard Steinberg, Richard E. Stone:
The Prevalence of Paradoxes in Transportation Equilibrium Problems. Transp. Sci. 22(4): 231-241 (1988) - Roger L. Tobin, Terry L. Friesz:
Sensitivity Analysis for Equilibrium Network Flow. Transp. Sci. 22(4): 242-250 (1988)
skipping 1 more match
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-26 05:48 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