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.
No takes yet. Share an insight, caveat, or question.
Picard et al. (1975) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: