Premium
Minimum cuts and related problems
Author(s) -
Picard J. C.,
Ratliff H. D.
Publication year - 1975
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230050405
Subject(s) - integer programming , characterization (materials science) , class (philosophy) , equivalence (formal languages) , minimum cut , mathematical optimization , mathematics , branch and cut , computer science , maximum cut , undirected graph , graph , combinatorics , discrete mathematics , artificial intelligence , materials science , nanotechnology
This paper is concerned with an integer programming characterization of a cut in a network. This characterization provides a fundamental equivalence between directed pseudosymmetric networks and undirected networks. It also identifies a class of problems which can be solved as minimum cut problems on a network.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom