Inverse minimum flow problem

DOI10.1007/BF02831968zbMath1131.90007MaRDI QIDQ874337

Eleonor Ciurea, Adrian Deaconu

Publication date: 5 April 2007

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Multi-objective and goal programming (90C29) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Related Items (7)

The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ On inverse traveling salesman problems ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ The inverse maximum flow problem consideringl_∞norm ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Solving the minimum flow problem with interval bounds and flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an instance of the inverse shortest paths problem
• Inverse problem of minimum cuts
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Sequential and parallel algorithms for minimum flows.
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Solving Inverse Spanning Tree Problems Through Network Flow Techniques
• Inverse maximum flow and minimum cut problems
• Combinatorial algorithms for inverse network flow problems
• A column generation method for inverse shortest path problems
• A Faster Algorithm for the Inverse Spanning Tree Problem

This page was built for publication: Inverse minimum flow problem