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

MaRDI QIDQ1582279zbMATHFDO

Authors 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)

Recommendations

• A polynomial time solvable concave network flow problem
• Strongly polynomial algorithm for two special minimum concave cost network flow problems
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• A strongly polynomial minimum cost circulation algorithm

Cited in

(6)

• A strongly polynomial contraction-expansion algorithm for network flow problems
• Strongly polynomial time algorithms for certain concave minimization problems on networks
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
• Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
• Bilinear modeling solution approach for fixed charge network flow problems
• scientific article; zbMATH DE number 1445399 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582279)