scientific article; zbMATH DE number 1795722

From MaRDI portal
Publication:4550771





The authors consider minimum cost network flow problems with piecewise linear arc costs (PLNFP). They present alternative formulations for a number of special cases. The convex PLNFP is formulated as an LP, the fixed charge network flow problem is formulated as an integer program, the concave PLNFP is formulated as fixed charge network flow problem in an extended network. Two cases of neither convex nor concave cost functions are formulated as mixed integer models of fixed charge network flow problems. Some applications of these models are sketched, but no numerical experiments reported. For the entire collection see [Zbl 0988.00046].











This page was built for publication:

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