default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTransportation Science, Volume 29
Volume 29, Number 1, February 1995
- John G. Klincewicz, Moshe B. Rosenwein:
The Airline Exception Scheduling Problem. 4-16 - Martin W. P. Savelsbergh
, Marc Sol:
The General Pickup and Delivery Problem. 17-29 - John N. Hooker, N. R. Natraj:
Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search. 30-44 - Marshall L. Fisher, Baoxing Tang, Zhang Zheng:
A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing. 45-55 - Michel Gendreau, Gilbert Laporte, Marius M. Solomon:
Single-Vehicle Routing and Scheduling to Minimize the Number of Delays. 56-62 - Irina Ioachim, Jacques Desrosiers, Yvan Dumas, Marius M. Solomon, Daniel Villeneuve:
A Request Clustering Algorithm for Door-to-Door Handicapped Transportation. 63-78 - Byung-Wook Wie, Roger L. Tobin, Terry L. Friesz, David Bernstein:
A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem. 79-92 - Robert F. Love, John H. Walker, Moti L. Tiku:
Confidence Intervals for lk, p, θ Distances. 93-100 - Peter Knoppers, Theo Muller:
Optimized Transfer Opportunities in Public Transport. 101-105
Volume 29, Number 2, May 1995
- Attahiru Sule Alfa, Marcel F. Neuts:
Modelling Vehicular Traffic Using the Discrete Time Markovian Arrival Process. 109-117 - Randolph W. Hall:
Longitudinal and Lateral Throughput on an Idealized Highway. 118-127 - David E. Boyce, Bin Ran, Larry J. LeBlanc:
Solving an Instantaneous Dynamic User-Optimal Route Choice Model. 128-142 - Michel Gendreau, Gilbert Laporte, René Séguin:
An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers. 143-155 - Robert A. Russell:
Hybrid Heuristics for the Vehicle Routing Problem with Time Windows. 156-166 - Russ J. Vander Wiel, Nikolaos V. Sahinidis:
Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem. 167-183 - Igor Averbakh, Oded Berman:
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree. 184-197
Volume 29, Number 3, August 1995
- Turgut Aykin:
Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System. 201-221 - Juho Hahm, Candace Arai Yano:
The Economic Lot and Delivery Scheduling Problem: Powers of Two Policies. 222-241 - James K. Higginson, James H. Bookbinder:
Markovian Decision Processes in Shipment Consolidation. 242-255 - Yehuda Bassok, Ricardo Ernst:
Dynamic Allocations for Multi-Product Distribution. 256-266 - Paulo Morelato França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller:
The m-Traveling Salesman Problem with Minmax Objective. 267-275 - Oded Berman, Dmitry Krass, Chen Wei Xu:
Locating Discretionary Service Facilities Based on Probabilistic Customer Flows. 276-290 - Hani S. Mahmassani:
TSS Dissertation Abstracts - Abstracts for the 1994 Transportation Science Section Dissertation Prize Competition. 291-301
Volume 29, Number 4, November 1995
- Giulio Erberto Cantarella, Ennio Cascetta:
Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory. 305-329 - Thomas A. Feo, José Luis González Velarde:
The Intermodal Trailer Assignment Problem. 330-341 - Dimitris Bertsimas, Philippe Chervi, Michael D. Peterson:
Computational Approaches to Stochastic Vehicle Routing Problems. 342-352 - Shu-Cherng Fang, H.-S. Jacob Tsao:
Linearly-Constrained Entropy Maximization Problem with Quadratic Cost and Its Applications to Transportation Planning Problems. 353-365 - Dominique Peeters, Isabelle Thomas:
The Effect of Spatial Structure on p-Median Results. 366-373 - Michael Wegener:
Bibliographic Section. 374-375
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.
last updated on 2024-10-18 19:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
