Implementing a proximal algorithm for some nonlinear multicommodity flow problems
From MaRDI portal
Publication:3418118
DOI10.1002/net.20138zbMath1131.90067OpenAlexW4230824065MaRDI QIDQ3418118
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20138
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (6)
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks ⋮ A practical method for solving large-scale TRS ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ A mean-variance model for the minimum cost flow problem with stochastic arc costs ⋮ A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
Uses Software
This page was built for publication: Implementing a proximal algorithm for some nonlinear multicommodity flow problems
