scientific article; zbMATH DE number 910909

MaRDI QIDQ4886085zbMATH OpenFDO

Authors Bruce Hoppe, Éva Tardos

Publication date 13 October 1996

zbMATH Keywords

dynamic networkpolynomial-time algorithmquickest transshipment problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• The quickest transshipment problem
• scientific article; zbMATH DE number 1303551
• scientific article; zbMATH DE number 1003275
• An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
• On solving quickest time problems in time-dependent, dynamic networks

Cited in

(18)

• Optimal building evacuation time considering evacuation routes
• One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
• Efficient continuous-time dynamic network flow algorithms
• The inverse-parametric knapsack problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• On solving quickest time problems in time-dependent, dynamic networks
• Discrete Newton methods for the evacuation problem
• Continuous dynamic contraflow approach for evacuation planning
• A survey on models and algorithms for discrete evacuation planning network problems
• The quickest transshipment problem
• The dynamic transshipment problem
• The mixed evacuation problem
• scientific article; zbMATH DE number 3932761 (Why is no real title available?)
• Fast and memory-efficient algorithms for evacuation problems
• Minimum cost dynamic flows: the series-parallel case
• MIN-MAX quickest path problems
• An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths
• One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886085)