The inverse maximum flow problem under L_k norms

MaRDI QIDQ4649340zbMATH OpenFDO

Authors Eleonor Ciurea, Adrian Deaconu

Publication date 21 November 2012

zbMATH Keywords

inverse combinatorial optimizationmaximum flowminimum cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• The inverse maximum flow problem consideringl_∞norm
• Inverse maximum flow problems under the combining norms
• The inverse maximum flow problem with lower and upper bounds for the flow
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• The inverse maximum flow problem under weighted \(l_\infty\) norm

Cited in

(10)

• Inverse feasibility problems of the inverse maximum flow problems
• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• A cardinality inverse maximum flow problem
• The inverse 1-maxian problem with edge length modification
• Inverse maximum flow problems under the combining norms
• The inverse maximum flow problem under weighted \(l_\infty\) norm
• The inverse maximum flow problem consideringl_∞norm
• The inverse maximum flow problem with lower and upper bounds for the flow
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm

This page was built for publication: The inverse maximum flow problem under \(L_k\) norms

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