Research Article

Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks

Pages:123–138

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.123.15245

Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems

Pages:139–152

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.139.15249

An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem

Pages:153–169

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.153.15243

Vehicle Routing and Scheduling with Full Truckloads

Pages:170–182

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.170.15248

Engine Routing and Scheduling at Industrial In-Plant Railroads

Pages:183–197

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.183.15251

A Variable Trip Time Model for Cyclic Railway Timetabling

Pages:198–212

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.198.15247

Using Integer Programming to Solve the Train-Platforming Problem

Pages:213–222

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.213.15250

TSL Dissertation Abstracts

Errata

Erratum: A Stochastic Modeling Approach to Real-Time Prediction of Queue Overflows

Pages:230–252

Published Online:May 1, 2003

https://doi.org/10.1287/trsc.37.2.230.15244

INFORMS Board of Directors and Editors for 2003

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.