scientific article
From MaRDI portal
Publication:3342177
zbMath0549.90033MaRDI QIDQ3342177
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
primal simplex algorithmflow conservationprocessing networksflow mergingflow splittingminimal cost flow problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (9)
Dynamic factorization in large-scale optimization ⋮ Layering strategies for creating exploitable structure in linear and integer programs ⋮ New ways in municipal flood mitigation: a mixed-integer programming approach and its practical application ⋮ An algorithm to solve the proportional network flow problem ⋮ Maximum flows in generalized processing networks ⋮ A compaction scheme and generator for distribution networks ⋮ Extending and solving a multiperiod congested network flow model ⋮ Solving embedded generalized network problems ⋮ New labeling procedures for the basis graph in generalized networks
Uses Software
This page was built for publication:
