scientific article; zbMATH DE number 1418034

MaRDI QIDQ4944302zbMATH OpenFDO

Authors Rainer E. Burkard, Karin Dlaska, Hans Kellerer

Publication date 9 February 2001

zbMATH Keywords

acyclic networksdisjoint flow problempolynomial algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• The quickest flow problem
• Distributed algorithms for the quickest path problem
• The quickest path problem
• On the quickest path problem
• The multichannel quickest-path problem

Cited in

(6)

• The inverse-parametric knapsack problem
• Efficient contraflow algorithms for quickest evacuation planning
• A survey on models and algorithms for discrete evacuation planning network problems
• The quickest flow problem
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
• scientific article; zbMATH DE number 7678024 (Why is no real title available?)

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 Q4944302)