Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
From MaRDI portal
Publication:3813579
DOI10.1287/OPRE.36.1.93zbMath0662.90027OpenAlexW1964540128MaRDI QIDQ3813579
Dimitri P. Bertsekas, Paul Tseng
Publication date: 1988
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/2882
minimum cost flow problemascent methodnetworks with gainsrelaxation of the flow conservation equations
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)
Related Items (27)
Improving the Hungarian assignment algorithm ⋮ Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations ⋮ An incremental primal-dual method for generalized networks ⋮ Network DEA-based biobjective optimization of product flows in a supply chain ⋮ Unnamed Item ⋮ Applying steepest-edge techniques to a network primal-dual algorithm ⋮ Dual coordinate step methods for linear network flow problems ⋮ Efficient parallel algorithms for the minimum cost flow problem ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Assignment-Control Plots: A Visual Companion for Causal Inference Study Design ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ Relaxation methods for monotropic programs ⋮ A survey of dynamic network flows ⋮ A least-squares minimum-cost network flow algorithm ⋮ The auction algorithm for the transportation problem ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ On the dual coordinate ascent approach for nonlinear networks ⋮ Cell formation using a Fuzzy Min-Max neural network ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs ⋮ A new dual based procedure for the transportation problem ⋮ Unnamed Item ⋮ Parallel primal-dual methods for the minimum cost flow problem ⋮ Simultaneous lotsizing and scheduling on parallel machines ⋮ The auction algorithm: A distributed relaxation method for the assignment problem ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Uses Software
This page was built for publication: Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
