Adaptive Labeling Algorithms for the Dynamic Assignment Problem
From MaRDI portal
Publication:2783873
DOI10.1287/trsc.34.1.50.12280zbMath1002.90035OpenAlexW2135751936MaRDI QIDQ2783873
Raymond K. Cheung, Wayne Snow, Warren B. Powell
Publication date: 17 April 2002
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.34.1.50.12280
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (4)
A general vehicle routing problem ⋮ A labeling method for dynamic driver-task assignment with uncertain task durations ⋮ Adaptive demand peak management in online transport process planning ⋮ A memetic algorithm for the multiperiod vehicle routing problem with profit
This page was built for publication: Adaptive Labeling Algorithms for the Dynamic Assignment Problem
