Strong polynomial-time solvability of a minimum concave cost network flow problem.

zbMath1057.90050MaRDI QIDQ1582279

Hoang Tuy

Publication date: 2000

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (1)

Bilinear modeling solution approach for fixed charge network flow problems

This page was built for publication: Strong polynomial-time solvability of a minimum concave cost network flow problem.