Sign in
A Perturbation-Based Duality Classification for Max-Flow Min-Cut Problems of Strang and Iri
Book chapter

A Perturbation-Based Duality Classification for Max-Flow Min-Cut Problems of Strang and Iri

Ryôhei Nozawa and K. O. Kortanek
Mathematical programming with data perturbations, pp.285-303
Marcel Dekker
1998
DOI: 10.1201/9781003072119-13

View Online

Abstract

Max Flow Min Cut Theorem Converse Inequality Optimal Cut Asymptotic Problem DS MFI Dense Continuous Linear Mapping Convex Programming Feasible Flow Convex Programming Problems Feasible Cut AC Function Space Setting Homogeneous Consistent CCI IAC Div Cut Capacity Max Flow Problem Green’s Formula Infinite Optimizations Feasible Solution Duality Gap Linear Topologies

Details

Metrics

1 Record Views
Logo image