An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

DOI10.1137/S1052623495285886zbMath0891.90065OpenAlexW1985236000MaRDI QIDQ4377576

Dimitri P. Bertsekas, L. C. Polymenakos, Paul Tseng

Publication date: 10 February 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623495285886

zbMATH Keywords

network flowsnetwork optimization\(\epsilon\)-relaxation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (4)

An ε-Relaxation method for generalized separable convex cost network flow problems ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ Implementation and test of auction methods for solving generalized network flow problems with separable convex cost

This page was built for publication: An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems