A decomposition method for solving multicommodity network equilibria

DOI10.1016/j.orl.2021.12.002OpenAlexW4200516429MaRDI QIDQ2670467

Minh N. Bui

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.03339

zbMATH Keywords

monotone operatortraffic assignmentnetwork flowsplitting algorithmnetwork equilibriumblock-iterative algorithm

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Resolvent and proximal compositions

Cites Work

• Linear passive systems and maximal monotone mappings
• On improvements to the analytic center cutting plane method
• The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
• Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
• A bundle-type algorithm for routing in telecommunication data networks
• A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• A Parallel Splitting Method for Coupled Monotone Inclusions
• A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
• Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
• Convex analysis and monotone operator theory in Hilbert spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decomposition method for solving multicommodity network equilibria