Pinto Paixão, J.M.

algorithm 0.00 vehicle problem auction network auction algorithm assignment number approach depot scheduling class instance network g quasiassignment block auction algorithms quasiassignment problem sdvsp cost structure value table 0.06 freling assignment problem science schedule result structure pinto transportation model solution wagelman two-phase single-depot density formulation nm log nc paixao performance core-oriented approach two-phase algorithm 0.05 2001 freling phase price paper nonpositive cost fi rst phase procedure bertseka i j ∈ trip i return two-phase approach auction procedure finition core approach iteration paix ão sequence assignment formulation network g q − t paths fl eet size ef ficient algorithms branco trav eip shortest-path algorithm class b network gs cost arcs ficient fi rst bus scheduling class e condition path ap