Network simplex algorithm for the general equal flow problem.

DOI10.1016/S0377-2217(02)00505-2zbMATH Open1033.90010MaRDI QIDQ1406491FDOQ1406491

Authors: Herminia I. Calvete 

Publication date: 4 September 2003

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

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

zbMATH Keywords

Simplex algorithmNetwork flowsEqual flowSide constraints

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for the simple equal flow problem
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• The equal flow problem

Cited In (14)

• Algorithms and complexity for the almost equal maximum flow problem
• Integer equal flows
• 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

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)