Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem

DOI10.1287/ijoc.1100.0384zbMath1243.90103OpenAlexW2104292969MaRDI QIDQ2899106

Faramroze Engineer, Savelsbergh, Martin W. P., Nemhauser, George I.

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1100.0384

zbMATH Keywords

dynamic programmingcolumn generationtime-expanded networksdial-a-flight

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Related Items (4)

Facets of the Stochastic Network Flow Problem ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ Solving a dial-a-flight problem using composite variables ⋮ Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem

This page was built for publication: Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem