A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost

By  

JOURNAL OF ADVANCED TRANSPORTATION, Vol. 197-6729, Iss. 6, 2015-10 ,pp. : 700-723

John Wiley & Sons Inc

Access to resources Recommend Favorite

A branch‐and‐price algorithm for the (k,c)‐coloring problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 353-366

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Queueing Framework for Routing Problems with Time-dependent Travel Times

By Woensel Tom   Kerbache Laoucine   Peremans Herbert   Vandaele Nico  

Journal of Mathematical Modelling and Algorithms, Vol. 6, Iss. 1, 2007-03 ,pp. : 151-173

Springer Publishing Company

Access to resources Recommend Favorite

The fastest itinerary in time-dependent decentralized travel information systems

By Wang Jinchang   Kämpke Thomas  

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 167-185

Springer Publishing Company

Access to resources Recommend Favorite

On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks

By Miller-Hooks Elise   Stock Patterson Sarah  

Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 1, 2004-01 ,pp. : 39-71

Springer Publishing Company

Access to resources Recommend Favorite