scientific article; zbMATH DE number 1303551

zbMATH Open0936.68008MaRDI QIDQ4250175FDOQ4250175

Authors:

Publication date: 18 May 2000

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

Recommendations

• Faster algorithms for the quickest transshipment problem
• The quickest transshipment problem
• The quickest flow problem

zbMATH Keywords

transshipment problemflow computations

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (8)

• The quickest transshipment problem
• Title not available (Why is that?)
• A note on the quickest minimum cost transshipment problem
• Optimal Rounding of Instantaneous Fractional Flows Over Time
• Efficient continuous-time dynamic network flow algorithms
• Cancel-and-tighten algorithm for quickest flow problems
• Title not available (Why is that?)
• 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 Q4250175)