Accession Number : AD0780924


Title :   Minimum Cuts and Related Problems.


Descriptive Note : Research rept.,


Corporate Author : FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING


Personal Author(s) : Picard,Jean-Claude ; Ratliff,H. Donald


Report Date : MAY 1974


Pagination or Media Count : 22


Abstract : The paper is concerned with an integer programming characterization of a cut in a network. This characterization provides a fundamental equivalence between directed pseudosummetric networks and undirected networks. It also identifies a class of problems which can be solved as minimum cut problems on a network. (Author)


Descriptors :   *INTEGER PROGRAMMING, *NETWORK FLOWS, SET THEORY, VECTOR SPACES


Subject Categories : OPERATIONS RESEARCH


Distribution Statement : APPROVED FOR PUBLIC RELEASE