Year: 2004
Type: article
Abstract: This paper summariz es the previous work on the problem of finding a generaliz ed maximum flow in a network n in addition to generaliz ed minimum cost flows in n .The generaliz ed maximum flow problem is a natural generaliz ation of the usual maximum flow problem.This paper is organiz ed as fo通 ows.We give notations and definitions for subsequent discussion in section 1. Section 2 formulates the optimiz ation problems as linea「 programming problems.In section 3, we give several applications as a generaliz ed maximum flow model and list the previous work for the generaliz ed maximum flow problem̲ Section 4 considers main polynomial algorithms for the generaliz ed maximum flow problem.Finally, Section concludes this article with future research.C ontents l .Basic network flow problems
Source: 行政社会論集
Author: Akira Nakayama
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2569960233
