The quickest path problem with batch constraints

Author： Calvete H.I.   del Pozo L.  

Publisher： Elsevier

ISSN： 0167-6377

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

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

An affine scaling interior trust region method via optimal path for solving monotone variational inequality problem with linear constraints

By Wang Yunjuan  

Chinese Annals of Mathematics, Series B, Vol. 29, Iss. 3, 2008-05 ,pp. : 273-290

Springer Publishing Company

Access to resources Recommend Favorite

The Exact Path Length Problem

By Nykanen M.   Ukkonen E.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 41-53

Elsevier

Access to resources Recommend Favorite

Path Integral Solution of the Dirichlet Problem

By LaChapelle J.  

Annals of Physics, Vol. 254, Iss. 2, 1997-03 ,pp. : 397-418

Elsevier

Access to resources Recommend Favorite

Structural results on a batch acceptance problem for capacitated queues

By Çil Eren  

Mathematical Methods of Operations Research, Vol. 66, Iss. 2, 2007-10 ,pp. : 263-274

Springer Publishing Company

Access to resources Recommend Favorite