Network simplex algorithm for the general equal flow problem.

DOI10.1016/S0377-2217(02)00505-2MaRDI QIDQ1406491zbMATH OpenFDO

Authors 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)

Recommendations

• A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
• A network flow algorithm for solving generalized assignment problem
• A specialized network simplex algorithm for the constrained maximum flow problem
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 1116645
• scientific article; zbMATH DE number 988194
• Algorithms for the simple equal flow problem
• A forward network simplex algorithm for solving multiperiod network flow problems
• An algorithm to solve the proportional network flow problem
• An efficient implementation of the network simplex method

Cites work

• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 758733 (Why is no real title available?)
• scientific article; zbMATH DE number 758742 (Why is no real title available?)
• scientific article; zbMATH DE number 795215 (Why is no real title available?)
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• Algorithms for the simple equal flow problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flows. Theory, algorithms, and applications.
• The equal flow problem

Cited in

(14)

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

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Network simplex algorithm for the general equal flow problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406491)