id: 05229648
dt: j
an: 05229648
au: Dahl, Geir; Minken, Harald
ti: Methods based on discrete optimization for finding road network
    rehabilitation strategies.
so: Comput. Oper. Res. 35, No. 7, 2193-2208 (2008).
py: 2008
pu: Elsevier Science Ltd. (Pergamon), Oxford
la: EN
cc: 
ut: discrete optimization; integer programming; dynamic programming; road
    (pavement) rehabilitation
ci: 
li: doi:10.1016/j.cor.2006.10.015
ab: Summary: We study a dynamic optimization problem arising in the (long-term)
    planning of road rehabilitation activities. In this area, one seeks a
    pavement resurfacing plan for a road network under budget constraints.
    Our main approach is to model this as an integer programming problem
    with underlying dynamic programming structure. We investigate
    properties of this model and propose a solution method based on
    Lagrangian relaxation where one gets subproblems that are shortest path
    problems. Some computational experiences based on realistic data are
    reported.
rv: