An algorithm to solve the proportional network flow problem
From MaRDI portal
Recommendations
- Proportional Equity Flow Problem for Terminal Arcs
- The equal flow problem
- Network simplex algorithm for the general equal flow problem.
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- A fast algorithm for bounded generalized processing networks
Cites work
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- Algorithms for the simple equal flow problem
- An improved primal simplex variant for pure processing networks
- Generalized Networks: Parallel Algorithms and an Empirical Analysis
- scientific article; zbMATH DE number 3876888 (Why is no real title available?)
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- Network simplex algorithm for the general equal flow problem.
- The equal flow problem
Cited in
(7)- Network simplex algorithm for the general equal flow problem.
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- Deciding probabilistic automata weak bisimulation: theory and practice
- Proportional Equity Flow Problem for Terminal Arcs
- Polynomial time decision algorithms for probabilistic automata
- Integrality in the multinetwork min‐cost equal‐flow problem
This page was built for publication: An algorithm to solve the proportional network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448159)
