Research Article

Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

Pages:285–298

Published Online:June 16, 2011

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

Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

Pages:299–316

Published Online:February 18, 2011

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

The Windy Clustered Prize-Collecting Arc-Routing Problem

Pages:317–334

Published Online:June 16, 2011

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

A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem

Pages:335–345

Published Online:February 18, 2011

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

Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands

Pages:346–363

Published Online:February 18, 2011

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

The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics

Pages:364–380

Published Online:June 16, 2011

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

Randomized Local Search for Real-Life Inventory Routing

Pages:381–398

Published Online:March 18, 2011

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

Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming

Pages:399–412

Published Online:September 24, 2010

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

The Mobile Facility Routing Problem

Pages:413–434

Published Online:September 24, 2010

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

Time Slot Management in Attended Home Delivery

Pages:435–449

Published Online:December 20, 2010

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

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.