A Primal Simplex Approach to Pure Processing Networks
From MaRDI portal
Publication:3750474
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
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
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
