Gale's feasibility theorem and max-flow problems in a continuous network(NONLINEAR ANALYSIS AND CONVEX ANALYSIS)
スポンサーリンク
概要
著者
関連論文
- 連続型最小カット問題のrelaxationとGaleのfeasibility theorem (非線形解析学と凸解析学の研究)
- Gale's feasibility theorem and max-flow problems in a continuous network(NONLINEAR ANALYSIS AND CONVEX ANALYSIS)
- A duality classification for max-flow min-cut problems of Strang and Iri(Continuous and Discrete Mathematical Optimization)
- A continuous version of Gale's feasibility theorem(Discrete and Continuous Structures in Optimization)