Inverse minimum flow problem

DOI10.1007/BF02831968zbMATH Open1131.90007MaRDI QIDQ874337FDOQ874337

Authors: Eleonor Ciurea, Adrian Deaconu 

Publication date: 5 April 2007

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

Recommendations

• The inverse maximum flow problem with lower and upper bounds for the flow
• The inverse maximum flow problem under weighted \(l_\infty\) norm
• Inverse maximum flow and minimum cut problems
• Inverse feasibility problems of the inverse maximum flow problems
• Inverse maximum flow problem in planar networks

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Inverse problem of minimum cuts
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow and minimum cut problems
• Combinatorial algorithms for inverse network flow problems
• On an instance of the inverse shortest paths problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Title not available (Why is that?)
• A column generation method for inverse shortest path problems
• Title not available (Why is that?)
• A Faster Algorithm for the Inverse Spanning Tree Problem
• Solving inverse spanning tree problems through network flow techniques
• Sequential and parallel algorithms for minimum flows.

Cited In (13)

• The inverse connected \(p\)-median problem on block graphs under various cost functions
• Inverse minimum flow problem under the weighted sum-type Hamming distance
• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
• Title not available (Why is that?)
• Solving the minimum flow problem with interval bounds and flows
• Minimax inverse problems of minimum cuts
• Constrained inverse minimum flow problems under the weighted Hamming distance
• The inverse maximum dynamic flow problem
• The inverse maximum flow problem consideringl_∞norm
• The inverse maximum flow problem with lower and upper bounds for the flow
• On inverse traveling salesman problems
• Capacity inverse minimum cost flow problem
• Inverse maximum flow and minimum cut problems

This page was built for publication: Inverse minimum flow problem

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