Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

DOI10.1007/s101070100254zbMath1074.90050OpenAlexW2034402198MaRDI QIDQ1849528

Olga Raskina, Bienstock, Daniel

Publication date: 1 December 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070100254

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (10)

Exact approaches to the single-source network loading problem ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ An interior-point approach for primal block-angular problems ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ An exact approach for the maximum concurrent \(k\)-splittable flow problem ⋮ Bounds on maximum concurrent flow in random bipartite graphs ⋮ Maximizing residual capacity in connection-oriented networks ⋮ k -Splittable delay constrained routing problem: A branch-and-price approach ⋮ Interior-point solver for convex separable block-angular problems ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners

This page was built for publication: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem