Solving difficult multicommodity problems with a specialized interior-point algorithm

DOI10.1023/B:ANOR.0000004761.99649.a5zbMath1053.90010OpenAlexW2145667263MaRDI QIDQ1417769

Jordi Castro

Publication date: 6 January 2004

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000004761.99649.a5

zbMATH Keywords

linear programminginterior-point methodsmulticommodity flowsnetwork optimization

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Deterministic network models in operations research (90B10)

Related Items

Large-scale optimization with the primal-dual column generation method ⋮ Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ An interior-point approach for primal block-angular problems ⋮ A linear model for compound multicommodity network flow problems ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ Interior-point solver for convex separable block-angular problems ⋮ On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths ⋮ IPM

Uses Software

• CPLEX
• KORBX
• PPRN