Network simplex algorithm for the general equal flow problem.

DOI10.1016/S0377-2217(02)00505-2zbMath1033.90010MaRDI QIDQ1406491

Herminia I. Calvete

Publication date: 4 September 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Simplex algorithmNetwork flowsEqual flowSide constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Extreme-point and pivoting methods (90C49)

Related Items

Deciding probabilistic automata weak bisimulation: theory and practice, Integer equal flows, A linear input dependence model for interdependent networks, Robust minimum cost flow problem under consistent flow constraints, Robust transshipment problem under consistent flow constraints, An algorithm to solve the proportional network flow problem, Polynomial time decision algorithms for probabilistic automata, Some further results on minimum distribution cost flow problems, A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks, A manufacturing supply chain optimization model for distilling process

Uses Software

• NETGEN

Cites Work

• The equal flow problem
• Algorithms for the Simple Equal Flow Problem
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item