PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS

DOI10.15807/JORSJ.37.297MaRDI QIDQ4840355zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multicommodity network flowapproximate saddle pointprimal-dual proximal point algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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)

• Multicommodity network flows: A survey. II: Solution methods
• scientific article; zbMATH DE number 7071840 (Why is no real title available?)
• Implementing a proximal algorithm for some nonlinear multicommodity flow problems
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• A decomposition method for solving multicommodity network equilibria
• Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

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)