A unified framework for primal-dual methods in minimum cost network flow problems
From MaRDI portal
Publication:3683845
DOI10.1007/BF01586087zbMath0567.90023MaRDI QIDQ3683845
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items (14)
An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems ⋮ Dual coordinate step methods for linear network flow problems ⋮ Infinite networks: Minimal cost flows ⋮ A survey of dynamic network flows ⋮ The auction algorithm for the transportation problem ⋮ Unnamed Item ⋮ Models for multimode multicommodity location problems with interdepot balancing requirements ⋮ A dual algorithm for submodular flow problems ⋮ On the computational behavior of a polynomial-time network flow algorithm ⋮ The value of runway time slots for airlines ⋮ A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements ⋮ Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems ⋮ Parallel primal-dual methods for the minimum cost flow problem ⋮ The auction algorithm: A distributed relaxation method for the assignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for the assignment problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- The alternating basis algorithm for assignment problems
- A Class of Decentralized Routing Algorithms Using Relaxation
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
- Convex Analysis
This page was built for publication: A unified framework for primal-dual methods in minimum cost network flow problems
