Examples of max-flow and min-cut problems with duality gaps in continuous networks |
| |
Authors: | Nozawa Ryôhei |
| |
Affiliation: | (1) Department of Mathematics, Sapporo Medical University, Minami-1, Nishi-17, Chuo-ku, 060 Sapporo, Japan |
| |
Abstract: | Strang (Mathematical Programming 26, 1983) gave a method to establish a max-flow min-cut theorem in a domain of a Euclidean space. The method can be applied also to max-flow min-cut problems defined by Iri (Survey of Mathematical Programming, North-Holland, 1979) whenever the capacity functions of max-flow problems are bounded and continuous. This paper deals with max-flow min-cut problems of Strang and Iri with unbounded or noncontinuous capacity functions. It is proved that, in such problems, max-flow min-cut theorems may fail to hold. |
| |
Keywords: | Max-flow problem min-cut problem duality gap |
本文献已被 SpringerLink 等数据库收录! |
|