Minimum cuts and related problems

Abstract

This paper is concerned with an integer progranming characterization of a cut i n a network. provides a fundamentat equivalence between directed pseudosymm e t r k netuorks and undirected netuorks. I t aZso i den t i f i e s a ctass of problems which can be sotved as minimum cut probtems on a network. This chaxacteAzation I. EQUIVALENCE RELATIONS FOR CUT… (More)
DOI: 10.1002/net.3230050405

Topics

3 Figures and Tables

Slides referencing similar topics