An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
From MaRDI portal
Publication:1591357
DOI10.1007/s101070000153zbMath1028.90006MaRDI QIDQ1591357
Paul Tseng, Dimitri P. Bertsekas
Publication date: 27 January 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Convex programming (90C25) Deterministic network models in operations research (90B10)
Related Items (7)
A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Maximum network flows with concave gains ⋮ A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints ⋮ Implementation and test of auction methods for solving generalized network flow problems with separable convex cost ⋮ Unnamed Item ⋮ Convex generalized flows ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
This page was built for publication: An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
