Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 13, 2026

Available Issues

April 10, 2013 - May 13, 2026

Research Article

Airline Fleet Assignment with Time Windows

Pages:1–20

Published Online:February 1, 2000

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

Preview Abstract
Alternative Approaches for Real-Time Estimation and Prediction of Time-Dependent Origin–Destination Flows

Pages:21–36

Published Online:February 1, 2000

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

Preview Abstract
A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem

Pages:37–49

Published Online:February 1, 2000

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

Preview Abstract
Adaptive Labeling Algorithms for the Dynamic Assignment Problem

Pages:50–66

Published Online:February 1, 2000

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

Preview Abstract
On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance

Pages:67–85

Published Online:February 1, 2000

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

Preview Abstract
Dynamic Routing for Priority Shipments in LTL Service Networks

Pages:86–98

Published Online:February 1, 2000

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

Preview Abstract
Stochastic Vehicle Routing Problem with Restocking

Pages:99–112

Published Online:February 1, 2000

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

Preview Abstract
A New Heuristic for the Traveling Salesman Problem with Time Windows

Pages:113–124

Published Online:February 1, 2000

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

Preview Abstract
Free Access
TSS Dissertation Abstracts—Abstracts for the 1999 Transportation Science Section Dissertation Prize Competition

Pages:125–130

Published Online:February 1, 2000

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree