Inverse maximum flow problems under the combining norms

DOI10.1007/978-3-642-38756-2_23MaRDI QIDQ5405932zbMATH OpenOpenAlexFDO

Authors Longcheng Liu

Publication date 3 April 2014

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38756-2_23

zbMATH Keywords

combining normsinverse problemmaximum flowstrongly polynomial algorithm

Mathematics Subject Classification ID

Flows in graphs (05C21) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10)

Recommendations

• The inverse maximum flow problem consideringl_∞norm
• The inverse maximum flow problem under L_k norms
• Combinatorial algorithms for inverse network flow problems
• Inverse feasibility problems of the inverse maximum flow problems
• The inverse maximum flow problem under weighted l_ norm

Cited in

(13)

• Inverse maximum capacity problems
• The inverse maximum flow problem under weighted l_ norm
• A cardinality inverse maximum flow problem
• The inverse maximum flow problem consideringl_∞norm
• Inverse maximum flow and minimum cut problems
• Reverse maximum flow problem under the weighted Chebyshev distance
• The inverse maximum flow problem under L_k norms
• Combinatorial algorithms for inverse network flow problems
• Inverse maximum flow problem in planar networks
• Optimal algorithms for inverse eccentric vertex location problem on extended star networks
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• Maximum Capacity Path Interdiction Problem with Fixed Costs
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees

This page was built for publication: Inverse maximum flow problems under the combining norms

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