scientific article; zbMATH DE number 1303551

MaRDI QIDQ4250175zbMATH OpenFDO

Authors

Publication date 18 May 2000

zbMATH Keywords

flow computationstransshipment problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

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

Cited in

(8)

• Efficient continuous-time dynamic network flow algorithms
• The quickest transshipment problem
• The quickest flow problem
• Optimal Rounding of Instantaneous Fractional Flows Over Time
• Cancel-and-tighten algorithm for quickest flow problems
• scientific article; zbMATH DE number 742963 (Why is no real title available?)
• scientific article; zbMATH DE number 910909 (Why is no real title available?)
• A note on the quickest minimum cost transshipment 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)