The equal flow problem

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

Bala Shetty, Agha Iqbal Ali, 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 bounds; decomposition; Lagrangean relaxation; lower bound; equal side constraints; right-hand-side allocation

Mathematics Subject Classification ID

90B10: Deterministic network models in operations research

Related Items

Integer equal flows, A survey of dynamic network flows, Layering strategies for creating exploitable structure in linear and integer programs, Using integer programming to verify general safety and liveness properties, Network simplex algorithm for the general equal flow problem., Future paths for integer programming and links to artificial intelligence, A generalization of Polyak's convergence result for subgradient optimization, An efficient lagrangean relaxation scheme for linear and integer equal flow problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item