scientific article; zbMATH DE number 1418034

zbMATH Open0954.90008MaRDI QIDQ4944302FDOQ4944302

Authors: Rainer E. Burkard, Karin Dlaska, Hans Kellerer 

Publication date: 9 February 2001

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

polynomial algorithmacyclic networksdisjoint flow problem

Mathematics Subject Classification ID

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

Cited In (6)

• The inverse-parametric knapsack problem
• The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
• Efficient contraflow algorithms for quickest evacuation planning
• Title not available (Why is that?)
• A survey on models and algorithms for discrete evacuation planning network problems
• The quickest flow problem

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)