Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
From MaRDI portal
Publication:3890442
DOI10.1287/opre.28.4.995zbMath0445.90086OpenAlexW2022321639MaRDI QIDQ3890442
No author found.
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.4.995
comparison of algorithmscomputational comparisonnumerical studyalgorithmic performanceprice-directive decompositionresource-directive decompositionbasic primal algorithmsmulticommodity network flow algorithmsprimal partitioning
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, A linear model for compound multicommodity network flow problems, Column generation algorithms for nonlinear optimization. II: Numerical investigations, The multicommodity assignment problem: A network aggregation heuristic, Multi-commodity flow problem on lossy network with partial lane reversals, A survey of dynamic network flows, Unnamed Item, Analysis of relaxations for the multi-item capacitated lot-sizing problem, A unified method for a class of convex separable nonlinear knapsack problems, A survey on the continuous nonlinear resource allocation problem, On the continuous quadratic knapsack problem, A polynomially bounded algorithm for a singly constrained quadratic program, An implementation of linear and nonlinear multicommodity network flows, Reoptimization procedures for bounded variable primal simplex network algorithms, Multicommodity network flows: The impact of formulation on decomposition
