An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times

Author： Hall Alex   Langkau Katharina   Skutella Martin  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.47, Iss.3, 2007-04, pp. : 299-321

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

Related content

Gated Polling Systems with Lévy Inflow and Inter-Dependent Switchover Times: A Dynamical-Systems Approach

By Eliazar Iddo  

Queueing Systems, Vol. 49, Iss. 1, 2005-01 ,pp. : 49-72

Springer Publishing Company

Access to resources Recommend Favorite

A comprehensive survey on the quickest path problem

By Pascoal Marta  

Annals of Operations Research, Vol. 147, Iss. 1, 2006-10 ,pp. : 5-21

Springer Publishing Company

Access to resources Recommend Favorite

Solution methods for material requirement planning with lot-size dependent lead times

By Jagannathan R.   Juang L.S.  

Annals of Operations Research, Vol. 76, Iss. 1, 1998-01 ,pp. : 201-217

Springer Publishing Company

Access to resources Recommend Favorite

Rescheduling on a single machine with part-type dependent setup times and deadlines

By Tamer Unal A.   Uzsoy R.   Kiran A.S.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 93-113

Springer Publishing Company

Access to resources Recommend Favorite

Production planning with load dependent lead times: an update of research

By Pahl Julia  

Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. : 297-345

Springer Publishing Company

Access to resources Recommend Favorite