Quickest cluster flow problems on tree networks

DOI10.1007/978-3-642-21527-8_29zbMATH Open1345.90019OpenAlexW2142665175MaRDI QIDQ3091508FDOQ3091508

Authors: Kathrin Leiner, Stefan Ruzika 

Publication date: 9 September 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21527-8_29

Recommendations

• The quickest transshipment problem
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Sink Evacuation on Trees with Dynamic Confluent Flows
• scientific article; zbMATH DE number 1003275
• MIN-MAX quickest path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (2)

• A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS
• Title not available (Why is that?)

This page was built for publication: Quickest cluster flow problems on tree networks

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