Research Article

Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows

Pages:267–286

Published Online:June 29, 2009

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

The Clustered Prize-Collecting Arc Routing Problem

Pages:287–300

Published Online:August 6, 2009

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

Tabu Search and Benders Decomposition Approaches for a Capacitated Closed-Loop Supply Chain Network Design Problem

Pages:301–320

Published Online:June 29, 2009

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

Fast Approaches to Improve the Robustness of a Railway Timetable

Pages:321–335

Published Online:June 29, 2009

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

Dynamic Airline Scheduling

Pages:336–354

Published Online:June 29, 2009

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

Optimal Baggage-Limit Policy: Airline Passenger and Cargo Allocation

Pages:355–369

Published Online:August 6, 2009

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

A New Approach for Air Cargo Network Planning

Pages:370–380

Published Online:August 6, 2009

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

An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice

Pages:381–394

Published Online:June 29, 2009

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

New Insights into Pedestrian Flow Through Bottlenecks

Pages:395–406

Published Online:May 7, 2009

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

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.