Inverse Maximum Flow Problems under the Combining Norms

DOI10.1007/978-3-642-38756-2_23zbMath1303.90015OpenAlexW37347353MaRDI QIDQ5405932

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

inverse problemmaximum flowstrongly polynomial algorithmcombining norms

Mathematics Subject Classification ID

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

Related Items (5)

Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

This page was built for publication: Inverse Maximum Flow Problems under the Combining Norms