The time‐dependent quickest path problem: Properties and bounds

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|66|2|112-117

ISSN： 0028-3045

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

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 quickest path problem with batch constraints

By Calvete H.I.   del Pozo L.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 277-284

Elsevier

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

The time-dependent rural postman problem: polyhedral results

By Tan Guozhen   Sun Jinghao   Hou Guangjian  

Optimization Methods and Software, Vol. 28, Iss. 4, 2013-08 ,pp. : 855-870

Taylor & Francis Ltd

Access to resources Recommend Favorite

Properties of a Time‐Dependent Nonlinear Viscous Critical Layer

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 22-2526, Iss. 2, 1987-10 ,pp. : 129-150

John Wiley & Sons Inc

Access to resources Recommend Favorite

Properties of a Time‐Dependent Nonlinear Viscous Critical Layer

By  

STUDIES IN APPLIED MATHEMATICS, Vol. 77, Iss. 2, 1987-10 ,pp. : 129-150

John Wiley & Sons Inc

Access to resources Recommend Favorite