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

Author： Miller-Hooks Elise   Stock Patterson Sarah  

Publisher： Springer Publishing Company

ISSN： 1570-1166

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The time‐dependent quickest path problem: Properties and bounds

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 2, 2015-09 ,pp. : 112-117

John Wiley & Sons Inc

Access to resources Recommend Favorite

A step-by-step method with Laguerre functions for solving time-dependent problems

By Demidov G.   Martynov V.  

Numerical Analysis and Applications, Vol. 3, Iss. 4, 2010-10 ,pp. : 336-343

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks

By Abbasi Sahar   Ebrahimnejad Sadoullah  

Optimization Methods and Software, Vol. 30, Iss. 3, 2015-05 ,pp. : 405-423

Taylor & Francis Ltd

Access to resources Recommend Favorite

Diffusion in Networks with Time-Dependent Transmission Conditions

By Arendt Wolfgang   Dier Dominik   Kramar Fijavž Marjeta  

Applied Mathematics and Optimization, Vol. 69, Iss. 2, 2014-04 ,pp. : 315-336

Springer Publishing Company

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