Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities

DOI10.1002/net.3230200405zbMath0715.90047OpenAlexW2080741044MaRDI QIDQ3202104

Masao Fukushima, Toshihide Ibaraki, Hiroshi Nagamochi

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200405

zbMATH Keywords

multicommodity flowcapacity constraintsrelaxation methodsnonlinear unconstrained minimizationstrictly convex cost function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ Unnamed Item ⋮ An implementation of a parallel primal-dual interior point method for block- structured linear programs

Cites Work

• Multicommodity flows in certain planar directed networks
• Unnamed Item

This page was built for publication: Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities