Maximum concurrent flow with incomplete data

DOI10.1007/978-3-319-96151-4_7MaRDI QIDQ1661862zbMATH OpenOpenAlexFDO

Authors Pierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti

Publication date 17 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_7

zbMATH Keywords

uncertaintyincomplete datainverse optimizationmaximum concurrent flowtransportation systemsmulti-commodity flow problemsunknown data

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Max concurrent flow problem
• The maximum concurrent flow problem
• Maximum concurrent flows and minimum cuts
• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Efficient algorithms for the maximum concurrent flow problem
• Maximum flow under proportional delay constraint
• scientific article; zbMATH DE number 6863577
• scientific article; zbMATH DE number 867664
• Maximum flows in generalized processing networks

Cited in

(2)

• Capturing incomplete information in resource allocation problems through numerical patterns
• Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

This page was built for publication: Maximum concurrent flow with incomplete data

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