Minimum cost problem of assembly network flows

DOI10.3969/J.ISSN.1673-5862.2016.02.009MaRDI QIDQ3180985zbMATH OpenFDO

Authors Qiaoli You

Publication date 6 January 2017

Full work available at URL https://doi.org/10.3969/J.ISSN.1673-5862.2016.02.009

zbMATH Keywords

assembly network flowsbasic feasible solutionminimum costnetwork simplex method

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 5173820
• Some further results on minimum distribution cost flow problems
• scientific article; zbMATH DE number 3876888
• Minimum cost problem of manufacturing network flows
• scientific article; zbMATH DE number 4174642

Cited in

(2)

• Minimum cost multi-product flow lines
• scientific article; zbMATH DE number 975812 (Why is no real title available?)

This page was built for publication: Minimum cost problem of assembly network flows

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