default search action
Transportation Science, Volume 28
Volume 28, Number 1, February 1994
- Warren B. Powell, Linos F. Frantzeskakis:
Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities. 3-23 - Robert B. Dial:
Minimizing Trailer-on-Flat-Car Costs: A Network Optimization Model. 24-36 - Nejib Ben-Khedher, Candace A. Yano:
The Multi-Item Joint Replenishment Problem with Transportation and Container Effects. 37-54 - Samer M. Madanat, Moshe E. Ben-Akiva:
Optimal Inspection and Repair Policies for Infrastructure Facilities. 55-62 - André de Palma, Qin Liu, Jacques-François Thisse:
Technical Note - Optimal Locations on a Line with Random Utilities. 63-69 - Yash P. Aneja, Mahmut Parlar:
Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel. 70-76 - C. M. Klein, Rex K. Kincaid:
Technical Note - The Discrete Anti-P-Center Problem. 77-79 - Fred Mannering:
Bibliographic Section. 80-81 - Dimitris Bertsimas:
TSS Dissertation Abstracts - Abstracts for the 1993 Transportation Science Section Dissertation Prize Competition. 82-89
Volume 28, Number 2, May 1994
- Gilbert Laporte, François V. Louveaux, Luc van Hamme:
Exact Solution to a Location Problem with Stochastic Demands. 95-103 - Dilip Chhajed, Timothy J. Lowe:
Solving Structured Multifacility Location Problems Efficiently. 104-115 - Y. Xu, Richard L. Francis, Timothy J. Lowe:
The Multimedian Location Problem on a Network Exploiting Block Structure. 116-124 - Margaret L. Brandeau, Samuel S. Chiu:
Location of Competing Facilities in a User-Optimizing Environment with Market Externalities. 125-140 - Roland Durier, Christian Michelot:
On the Set of Optimal Points to the Weber Problem: Further Results. 141-149 - Mamnoon Jamil, Rajan Batta, David M. Malon:
The Traveling Repairperson Home Base Location Problem. 150-161 - Igor Averbakh, Oded Berman:
Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path. 162-166 - Mordechai Jaeger, Jeff Goldberg:
Technical Note - A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees. 167-175
Volume 28, Number 3, August 1994
- Enrique Fernández, Joaquín de Cea, Michael Florian, Enrique Cabrera:
Network Equilibrium Models with Combined Modes. 182-192 - Jia Hao Wu, Michael Florian, Patrice Marcotte:
Transit Equilibrium Assignment: A Model and Solution Algorithms. 193-203 - Byung-Wook Wie, Roger L. Tobin, Terry L. Friesz:
The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time. 204-220 - David Bernstein, Tony E. Smith:
Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing. 221-235 - W. J. Hurley, E. R. Petersen:
Nonlinear Tariffs and Freight Network Equilibrium. 236-245 - Süleyman Özekici, Selim Sengör:
On a Rail Transportation Model with Scheduled Services. 246-255 - Judith M. Farvolden, Warren B. Powell:
Subgradient Methods for the Service Network Design Problem. 256-272
Volume 28, Number 4, November 1994
- Peter B. M. Vranas, Dimitris Bertsimas, Amedeo R. Odoni:
Dynamic Ground-Holding Policies for a Network of Airports. 275-291 - Mayiz B. Habbal, Haris N. Koutsopoulos, Steven R. Lerman:
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures. 292-308 - Raj A. Sivakumar, Rajan Batta:
The Variance-Constrained Shortest Path Problem. 309-316 - John R. Current, Hasan Pirkul, Erik Rolland:
Efficient Algorithms for Solving the Shortest Covering Path Problem. 317-327 - M. Eric Johnson, Margaret L. Brandeau:
An Analytic Model for Design and Analysis of Single-Vehicle Asynchronous Material Handling Systems. 337-353 - Patrick Jaillet, David Bernstein, John D. Leonard II, Dean Taylor:
Bibliographic Section. 354-361
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.