On the Fine-Grain Decomposition of Multicommodity Transportation Problems

DOI10.1137/0801038zbMath0754.90058OpenAlexW1989238329MaRDI QIDQ4012440

Stavros A. Zenios

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5198

zbMATH Keywords

decompositionmulticommodity transportation constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Data parallel computing for network-structured optimization problems ⋮ Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs ⋮ A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ ⋮ PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ Interval underrelaxed bregman's method with an application ⋮ An implementation of a parallel primal-dual interior point method for block- structured linear programs

This page was built for publication: On the Fine-Grain Decomposition of Multicommodity Transportation Problems