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

DOI10.1137/S1052623495285886MaRDI QIDQ4377576zbMATH OpenOpenAlexFDO

Authors 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

\(\epsilon\)-relaxationnetwork flowsnetwork optimization

Mathematics Subject Classification ID

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

Recommendations

• An -relaxation method for generalized separable convex cost network flow problems
• An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
• Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
• scientific article; zbMATH DE number 1086907
• The partitioned -relaxation algorithm for separable convex network flow problems

Cited in

(15)

• The partitioned -relaxation algorithm for separable convex network flow problems
• LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
• An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
• Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
• A fast exact method for the capacitated facility location problem with differentiable convex production costs
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems
• A Newton method for convex separable network flow problems
• A hybrid algorithm for solving convex separable network flow problems
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• scientific article; zbMATH DE number 1086907 (Why is no real title available?)
• An -relaxation method for generalized separable convex cost network flow problems
• scientific article; zbMATH DE number 4116282 (Why is no real title available?)
• A proximal subgradient projection algorithm for linearly constrained strictly convex problems
• Parallel algorithms for solving the convex minimum cost flow problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377576)