Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms

DOI10.1287/OPRE.28.4.995MaRDI QIDQ3890442zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

numerical studycomparison of algorithmscomputational comparisonalgorithmic performanceprice-directive decompositionresource-directive decompositionbasic primal algorithmsmulticommodity network flow algorithmsprimal partitioning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(16)

• Multicommodity network flows: A survey. II: Solution methods
• Multi-commodity flow problem on lossy network with partial lane reversals
• A polynomially bounded algorithm for a singly constrained quadratic program
• An implementation of linear and nonlinear multicommodity network flows
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• A linear model for compound multicommodity network flow problems
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• A unified method for a class of convex separable nonlinear knapsack problems
• Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
• Column generation algorithms for nonlinear optimization. II: Numerical investigations
• On the continuous quadratic knapsack problem
• A survey on the continuous nonlinear resource allocation problem
• A survey of dynamic network flows
• The multicommodity assignment problem: A network aggregation heuristic
• Reoptimization procedures for bounded variable primal simplex network algorithms
• Multicommodity network flows: The impact of formulation on decomposition

This page was built for publication: Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms

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