scientific article; zbMATH DE number 4116282

MaRDI QIDQ4730998zbMATH OpenFDO

Authors C. Pasche

Publication date 1989

zbMATH Keywords

discretizationlinear functionsnetwork simplex methodconvex separable costsapproximation by piecewise

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Flot à coût convexe linéaire par morceaux
• Solving integer minimum cost flows with separable convex cost objective polynomially
• scientific article; zbMATH DE number 1342118
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
• An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

Cited in

(2)

• Flot à coût convexe linéaire par morceaux
• scientific article; zbMATH DE number 3970527 (Why is no real title available?)

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