A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS

DOI10.15807/JORSJ.27.151MaRDI QIDQ3329185zbMATH OpenOpenAlexFDO

Authors Masao Fukushima

Publication date 1984

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.27.151

zbMATH Keywords

computational resultscongested road networkdual problemimplementation of the algorithmmulticommodity flow problemnonsmooth optimization approachtraffic equilibrium

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Recommendations

• Optimal Two-commodity Flows with Non-linear Cost Functions
• Nonlinear cost network models in transportation analysis
• An implementation of linear and nonlinear multicommodity network flows
• Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Cited in

(14)

• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
• A bundle-type algorithm for routing in telecommunication data networks
• A decomposition method for solving multicommodity network equilibria
• scientific article; zbMATH DE number 5613782 (Why is no real title available?)
• Nonlinear cost network models in transportation analysis
• Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
• A computationally efficient method for nonlinear multicommodity network flow problems
• Inverse Nonlinear Multicommodity Flow Optimization by Column Generation
• Optimal Two-commodity Flows with Non-linear Cost Functions
• Monotonicity and conformality in multicommodity network‐flow problems
• Cyclically monotone non-optimal N-marginal transport plans and Smirnov-type decompositions for N-flows
• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

This page was built for publication: A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS

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