Los puntos clave no están disponibles para este artículo en este momento.
Abstract 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.
Picard et al. (Wed,) studied this question.