PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
From MaRDI portal
Publication:4840355
DOI10.15807/JORSJ.37.297zbMATH Open0828.90035OpenAlexW2100984373MaRDI QIDQ4840355FDOQ4840355
Authors: Satoru Ibaraki, Masao Fukushima 
Publication date: 24 July 1995
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.37.297
Recommendations
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- scientific article; zbMATH DE number 1070392
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- A primal-dual algorithm for monotropic programming and its application to network optimization
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
Cited In (7)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Title not available (Why is that?)
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- A decomposition method for solving multicommodity network equilibria
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- Multicommodity network flows: A survey. II: Solution methods
This page was built for publication: PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840355)
