Inverse feasibility problems of the inverse maximum flow problems

DOI10.1007/S12046-013-0134-4MaRDI QIDQ261056zbMATH OpenOpenAlexFDO

Authors Eleonor Ciurea, Adrian Deaconu

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

zbMATH Keywords

inverse combinatorial optimizationmaximum flowminimum cut

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Inverse minimum flow problem
• Inverse maximum flow and minimum cut problems
• The inverse maximum flow problem with lower and upper bounds for the flow
• The inverse maximum flow problem under \(L_k\) norms
• The inverse maximum dynamic flow problem

Cites work

• AO(nm log(U/n)) time maximum flow algorithm
• Beyond the flow decomposition barrier
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow and minimum cut problems
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse problem of minimum cuts
• Network flows. Theory, algorithms, and applications.
• The inverse maximum flow problem consideringl_∞norm
• The inverse maximum flow problem with lower and upper bounds for the flow

Cited in

(6)

• The inverse maximum flow problem consideringl_∞norm
• Robust partial inverse network flow problems
• Capacity inverse minimum cost flow problem
• Inverse minimum flow problem
• Inverse maximum flow problems under the combining norms
• Inverse maximum flow and minimum cut problems

This page was built for publication: Inverse feasibility problems of the inverse maximum flow problems

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