Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

INVERSE MINIMUM FLOW PROBLEM

  • Ciurea, Eleonor (Department of Theoretical Computer Science, Transilvania University) ;
  • Deaconu, Adrian (Department of Theoretical Computer Science, Transilvania University)
  • Published : 2007.01.31

⟨ Previous Next ⟩

Abstract

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

Keywords