A Primal Simplex Approach to Pure Processing Networks

From MaRDI portal

Revision as of 11:13, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3750474

Jump to:navigation, search

DOI10.1287/mnsc.32.12.1582zbMath0609.90042OpenAlexW2128498640MaRDI QIDQ3750474

Michael Engquist, Chou-Hong J. Chen

Publication date: 1986

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.32.12.1582

zbMATH Keywords

minimum cost flow problems primal simplex variants Pure processing network problems

Mathematics Subject Classification ID

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

Related Items (7)

Dynamic factorization in large-scale optimization ⋮ Triangularity of the basis in linear programs for material requirements planning ⋮ A survey of dynamic network flows ⋮ Maximum flows in generalized processing networks ⋮ A compaction scheme and generator for distribution networks ⋮ Extending and solving a multiperiod congested network flow model ⋮ Future paths for integer programming and links to artificial intelligence

This page was built for publication: A Primal Simplex Approach to Pure Processing Networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3750474&oldid=17275354"