[PDF][PDF] A global optimization method for minimum maximal flow problem
J Shi, Y Yamamoto - Acta Mathematica Vietnamica, 1997 - researchgate.net
J Shi, Y Yamamoto
Acta Mathematica Vietnamica, 1997•researchgate.netIn this paper, we present two approaches for solving an NP-hard problem: minimum
maximal flow problem, ie, min {ξ∣∣ ξ is a maximal flow}. We introduce lower bounds on
flow, and cast the problem into a minimization of a concave function over a convex set. We
solve the problem by a global optimization method. As an application, we consider the
minimum maximal matching problem. Some numerical experiments are also reported.
maximal flow problem, ie, min {ξ∣∣ ξ is a maximal flow}. We introduce lower bounds on
flow, and cast the problem into a minimization of a concave function over a convex set. We
solve the problem by a global optimization method. As an application, we consider the
minimum maximal matching problem. Some numerical experiments are also reported.
Abstract
In this paper, we present two approaches for solving an NP-hard problem: minimum maximal flow problem, ie, min {ξ∣∣ ξ is a maximal flow}. We introduce lower bounds on flow, and cast the problem into a minimization of a concave function over a convex set. We solve the problem by a global optimization method. As an application, we consider the minimum maximal matching problem. Some numerical experiments are also reported.
researchgate.net
以上显示的是最相近的搜索结果。 查看全部搜索结果