default search action
Transportation Science, Volume 30
Volume 30, Number 1, February 1996
- Anna Nagurney, Padma Ramanujam:
Transportation Network Policy Modeling with Goal Targets and Generalized Penalty Functions. 3-13 - Terry L. Friesz, David Bernstein, Roger Stough:
Dynamic Systems, Variational Inequalities and Control Theoretic Models for Predicting Time-Varying Urban Network Flows. 14-31 - Gordon F. Newell:
Non-Convex Traffic Assignment on a Rectangular Grid Network. 32-42 - Raymond K.-M. Cheung, Warren B. Powell:
Models and Algorithms for Distribution Problems with Uncertain Demands. 43-59 - Carlo Filippi, Giorgio Romanin-Jacur:
Optimal Allocation of Two Fixed Service Units Acting as M/G/1 Queues. 60-74 - Prakash Mirchandani, Rajeev Kohli, Arie Tamir:
Capacitated Location Problems on a Line. 75-80 - Jeffrey I. McGill:
TSS Dissertation Abstracts - Abstracts for the 1995 Transportation Science Section Dissertation Prize Competition. 81-86
Volume 30, Number 2, May 1996
- Robert B. Dial:
Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms. 93-111 - Seth A. Asante, Siamak A. Ardekani, James C. Williams:
A Simulation Study of the Operational Performance of Left-Turn Phasing and Indication Sequences. 112-119 - Robert F. Dell, Rajan Batta, Mark H. Karwan:
The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon. 120-133 - Ian R. Webb:
Depth-First Solutions for the Deliveryman Problem on Tree-Like Networks: An Evaluation Using a Permutation Model. 134-147 - Barbaros Ç. Tansel, Gülcan N. Yesïlkökçen:
Composite Regions of Feasibility for Certain Classes of Distance Constrained Network Location Problems. 148-159 - Richard L. Francis, Timothy J. Lowe, M. Brenda Rayco:
Row-Column Aggregation for Rectilinear Distance p-Median Problems. 160-174 - Ezra Hauer, Isam A. Kaysi:
Bibliographic Section. 175-178
Volume 30, Number 3, August 1996
- Peter J. Zwaneveld, Leo G. Kroon, H. Edwin Romeijn, Marc Salomon, Stéphane Dauzère-Pérès, Stan P. M. van Hoesel, Harrie W. Ambergen:
Routing Trains Through Railway Stations: Model Formulation and Algorithms. 181-194 - Warren B. Powell:
A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers. 195-219 - Ishwar Murthy, Sumit Sarkar:
A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems. 220-236 - Kalyan T. Talluri:
Swapping Applications in a Daily Airline Fleet Assignment. 237-248 - Lloyd W. Clarke, Christopher A. Hane, Ellis L. Johnson, George L. Nemhauser:
Maintenance and Crew Considerations in Fleet Assignment. 249-260 - Igor Averbakh, Oded Berman:
Technical Note - A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree. 261-269 - Frank Southworth, Laura Wynter:
Bibliographic Section. 270-272
Volume 30, Number 4, November 1996
- Yale T. Herer, M. J. Rosenblatt, I. Hefter:
Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation. 276-290 - Hasan Pirkul, Vaidyanathan Jayaraman:
Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System. 291-302 - Igor Averbakh, Oded Berman:
Routing Two-Machine Flowshop Problems on Networks with Special Structure. 303-314 - Mahdi Kamoun, Candace Arai Yano:
Facility Layout to Support Just-in-Time. 315-329 - M. Eric Johnson, Margaret L. Brandeau:
Stochastic Modeling for Automated Material Handling System Design and Control. 330-350 - Ulrich W. Thonemann, Margaret L. Brandeau:
Designing A Single-Vehicle Automated Guided Vehicle System with Multiple Load Capacity. 351-363 - Susan Fraley Hallowell, Patrick T. Harker:
Predicting On-Time Line-Haul Performance in Scheduled Railroad Operations. 364-378 - Jiefeng Xu, James P. Kelly:
A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem. 379-393
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.