Acta Mathematica Vietnamica
Search within journal
Volumes and issues
STRONG POLYNOMIAL-TIME SOLVABILITY OF A MINIMUM CONCAVE COST NETWORK FLOW PROBLEM
HOANG TUYpp. 209-217
Abstract
A new simple proof is given of the strong polynomial-time solvability of the single source uncapacitated minimum concave cost network flow problem (SSUMCCNFP) with a fixed number of nonlinear arc costs.