A hybrid algorithm for solving network flow problems with side constraints.
From MaRDI portal
Publication:1406684
DOI10.1016/S0305-0548(98)00001-XzbMath1040.90556MaRDI QIDQ1406684
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
A novel approach to subgraph selection with multiple weights on arcs ⋮ A linear input dependence model for interdependent networks ⋮ A network simplex method for the budget-constrained minimum cost flow problem ⋮ Some further results on minimum distribution cost flow problems ⋮ A specialized network simplex algorithm for the constrained maximum flow problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A surrogate and Lagrangian approach to constrained network problems
- Network flow problems with one side constraint: A comparison of three solution methods
- MOPS -- Mathematical optimization system
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The simplex SON algorithm for LP/embedded network problems
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Validation of subgradient optimization