Maximum concurrent flow with incomplete data

DOI10.1007/978-3-319-96151-4_7zbMATH Open1403.90629OpenAlexW2884383321MaRDI QIDQ1661862FDOQ1661862

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

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)

Cited In (1)

• Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

Recommendations

• The maximum concurrent flow problem 👍 👎
• Maximum flows in generalized processing networks 👍 👎
• Approximation Algorithms for the Maximum Concurrent Flow Problem 👍 👎
• Efficient algorithms for the maximum concurrent flow problem 👍 👎
• Maximum concurrent flows and minimum cuts 👍 👎
• Maximum flow under proportional delay constraint 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)