Minimum cuts and related problems

Networks

Volumn 5, Issue 4, 1975, Pages 357-370

  Picard, J C ^a   Ratliff, H D ^b  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

INTEGER PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0016565825     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230050405     Document Type: Article

References (9)

1. On a Selection Problem
2. Maximal Flow Through a Network
3. Multi‐Terminal Network Flows
4. On Flows in Pseudosymmetric Networks
5. Some Network Flow Problems Solved with Pseudo‐Boolean Programming
6. A Graph Theoretic Equivalence for Interger Programs
7. Minimum Cost Cut Equivalent Networks
8. Shared Fixed Cost and Network Flows