Inverse feasibility problems of the inverse maximum flow problems
From MaRDI portal
Publication:261056
DOI10.1007/s12046-013-0134-4zbMath1332.90047OpenAlexW1970914699MaRDI QIDQ261056
Adrian Deaconu, Eleonor Ciurea
Publication date: 22 March 2016
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12046-013-0134-4
Cites Work
- Unnamed Item
- Inverse problem of minimum cuts
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse maximum flow problems under the weighted Hamming distance
- Beyond the flow decomposition barrier
- The inverse maximum flow problem consideringl∞norm
- The inverse maximum flow problem with lower and upper bounds for the flow
- Inverse maximum flow and minimum cut problems
- AO(nm log(U/n)) time maximum flow algorithm
This page was built for publication: Inverse feasibility problems of the inverse maximum flow problems