Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
From MaRDI portal
Publication:3813579
DOI10.1287/opre.36.1.93zbMath0662.90027MaRDI 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 problem; ascent method; networks with gains; relaxation of the flow conservation equations
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
Related Items
Cell formation using a Fuzzy Min-Max neural network, Unnamed Item, An ε-Relaxation method for generalized separable convex cost network flow problems, Unnamed Item, Min-Cost Flow in Unit-Capacity Planar Graphs, A simple GAP-canceling algorithm for the generalized maximum flow problem, Assignment-Control Plots: A Visual Companion for Causal Inference Study Design, Minimal-cost network flow problems with variable lower bounds on arc flows, A least-squares minimum-cost network flow algorithm, Relaxation methods for monotropic programs, A survey of dynamic network flows, The auction algorithm for the transportation problem, Improving the Hungarian assignment algorithm, Dual coordinate step methods for linear network flow problems, On the dual coordinate ascent approach for nonlinear networks, Parallel primal-dual methods for the minimum cost flow problem, The auction algorithm: A distributed relaxation method for the assignment problem, Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations, An incremental primal-dual method for generalized networks, Applying steepest-edge techniques to a network primal-dual algorithm, Efficient parallel algorithms for the minimum cost flow problem, A new dual based procedure for the transportation problem, Simultaneous lotsizing and scheduling on parallel machines, Network DEA-based biobjective optimization of product flows in a supply chain, Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup, A decomposition approach for the general lotsizing and scheduling problem for parallel production lines, Minimum-cost flow algorithms: an experimental evaluation
Uses Software
