Optimal Rounding of Instantaneous Fractional Flows Over Time

DOI10.1137/S0895480198344138zbMATH Open0941.68058OpenAlexW1989585214MaRDI QIDQ4490776FDOQ4490776

Authors: Lisa Fleischer, James B. Orlin 

Publication date: 20 July 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480198344138

Recommendations

• Faster algorithms for the quickest transshipment problem
• Minimum cost time-varying network flow problems
• Minimum Convex Cost Dynamic Network Flows
• scientific article; zbMATH DE number 1303551
• Constructing maximal dynamic flows from static flows

zbMATH Keywords

analysis of algorithmsnetwork flowsconvex costsdynamic transshipment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

This page was built for publication: Optimal Rounding of Instantaneous Fractional Flows Over Time

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