Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Graph theory and its applications
Graph theory and its applications
Network Models in Optimization and Their Applications in Practice
Network Models in Optimization and Their Applications in Practice
Solving Inverse Spanning Tree Problems Through Network Flow Techniques
Operations Research
Combinatorial optimization: mutual relations among graph algorithms
WSEAS Transactions on Mathematics
Sequential and parallel deficit scaling algorithms for minimum flow in bipartite networks
WSEAS Transactions on Computers
A parallel algorithm for the minimum flow problem in bipartite networks
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Decreasing path algorithm for minimum flows: dynamic tree implementations
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Minimum flows in bipartite networks
MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering
Transfomation of non-feasible inverse maximum flow problem into a feasible one by flow modification
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
A study on the feasibility of the inverse supply and demand problem
Proceedings of the 15th WSEAS international conference on Computers
| Hi-index | 0.00 |
The feasibility of the inverse maximum flow problems (denoted IMFG) is studied. The feasibility can be tested in linear time. In the case of IMFG not being feasible, a new inverse combinatorial optimization problem is introduced and solved. The problem is to modify as little as possible the flow so that the problem becomes feasible for the modified flow. An example is presented.