Transfomation of non-feasible inverse maximum flow problem into a feasible one by flow modification

Authors:
Adrian Deaconu;Eleonor Ciurea;Corneliu Marinescu
Affiliations:
Transilvania Univ. of Braşov, Theoretical Computer Science Dept., Braşov, Romania;Transilvania Univ. of Braşov, Theoretical Computer Science Dept., Braşov, Romania;Transilvania University of Braşov, Electrical Eng. and Computer Sci., Braşov, Romania
Venue:
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
Year:
2010

Citing 2
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Solving Inverse Spanning Tree Problems Through Network Flow Techniques

Operations Research

A study on the feasibility of the inverse maximum flow problems and flow modification techniques in the case of non-feasibility

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear time method to decide if any inverse maximum flow (denoted IMFG) problem has solution is presented. For 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.