Takashi Akamatsu and Benjamin Heydecker

Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks
TRANSPORTATION SCIENCE 2003 37: 123-138. [Abstract] [PDF] [References]  

Minghe Sun

Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems
TRANSPORTATION SCIENCE 2003 37: 139-152. [Abstract] [PDF] [References]  

N. R. Achuthan, L. Caccetta, and S. P. Hill

An Improved Branch–and–Cut Algorithm for the Capacitated Vehicle Routing Problem
TRANSPORTATION SCIENCE 2003 37: 153-169. [Abstract] [PDF] [References]  

Sundararajan Arunapuram, Kamlesh Mathur, and Daniel Solow

Vehicle Routing and Scheduling with Full Truckloads
TRANSPORTATION SCIENCE 2003 37: 170-182. [Abstract] [PDF] [References]  

Marco E. Lübbecke and Uwe T. Zimmermann

Engine Routing and Scheduling at Industrial In-Plant Railroads
TRANSPORTATION SCIENCE 2003 37: 183-197. [Abstract] [PDF] [References]  

Leo G. Kroon and Leon W. P. Peeters

A Variable Trip Time Model for Cyclic Railway Timetabling
TRANSPORTATION SCIENCE 2003 37: 198-212. [Abstract] [PDF] [References]  

Alain Billionnet

Using Integer Programming to Solve the Train-Platforming Problem
TRANSPORTATION SCIENCE 2003 37: 213-222. [Abstract] [PDF] [References]  

Pitu B. Mirchandani

Abstracts for the 2002 Transportation Science Section Dissertation Prize Competition
TRANSPORTATION SCIENCE 2003 37: 223-229. [Abstract] [PDF]  

Jiuh–Biing Sheu

Erratum: A Stochastic Modeling Approach to Real–Time Prediction of Queue Overflows
TRANSPORTATION SCIENCE 2003 37: 230-252. [Abstract] [PDF] [References]  

Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2003
TRANSPORTATION SCIENCE 2003 37: 253. [Abstract] [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.