The equal flow problem

DOI10.1016/0377-2217(88)90012-4zbMath0653.90015OpenAlexW2046222814MaRDI QIDQ1108179

Agha Iqbal Ali, Bala Shetty, Jeffrey L. Kennington

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90012-4

zbMATH Keywords

upper boundsdecompositionLagrangean relaxationlower boundequal side constraintsright-hand-side allocation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Integer equal flows, Using integer programming to verify general safety and liveness properties, Layering strategies for creating exploitable structure in linear and integer programs, Robust minimum cost flow problem under consistent flow constraints, Integrality in the multinetwork min‐cost equal‐flow problem, A generalization of Polyak's convergence result for subgradient optimization, Robust transshipment problem under consistent flow constraints, Network simplex algorithm for the general equal flow problem., A survey of dynamic network flows, An algorithm to solve the proportional network flow problem, A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks, Future paths for integer programming and links to artificial intelligence, An efficient lagrangean relaxation scheme for linear and integer equal flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• Network models for vehicle and crew scheduling
• Reoptimization procedures for bounded variable primal simplex network algorithms
• A generalization of Polyak's convergence result for subgradient optimization
• A polynomially bounded algorithm for a singly constrained quadratic program
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A Reduced Gradient Algorithm for Nonlinear Network Problems