Flot à coût convexe linéaire par morceaux

DOI10.1051/RO/1987210302051zbMATH Open0623.90017OpenAlexW2488554528MaRDI QIDQ3762038FDOQ3762038

Authors: C. Pasche 

Publication date: 1987

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104921

Recommendations

• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
• scientific article; zbMATH DE number 4116282
• scientific article; zbMATH DE number 1795722
• Network optimization with piecewise linear convex costs
• scientific article; zbMATH DE number 1195629

zbMATH Keywords

network flowmodified network simplex methodpiecewise linear convex cost function

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Cited In (7)

• Title not available (Why is that?)
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
• A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
• On the simplex algorithm for networks and generalized networks
• Network optimization with piecewise linear convex costs
• A parametric algorithm for convex cost network flow and related problems
• Title not available (Why is that?)

This page was built for publication: Flot à coût convexe linéaire par morceaux

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