A Specialized Interior-Point Algorithm for Multicommodity Network Flows
From MaRDI portal
Publication:4509740
DOI10.1137/S1052623498341879zbMath0955.90087MaRDI QIDQ4509740
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Interior-point methods (90C51)
Related Items
A new Lagrangian-Benders approach for a concave cost supply chain network design problem ⋮ Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ A new interior-point approach for large separable convex quadratic two-stage stochastic problems ⋮ Mathematical programming approaches for classes of random network problems ⋮ Crash start of interior point methods ⋮ Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ An interior-point approach for primal block-angular problems ⋮ Prim-based support-graph preconditioners for min-cost flow problems ⋮ A linear model for compound multicommodity network flow problems ⋮ Existence, uniqueness, and convergence of the regularized primal-dual central path ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems ⋮ On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach ⋮ Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems ⋮ Interior point methods 25 years later ⋮ Algorithms for Finding Optimal Flows in Dynamic Networks ⋮ A preconditioning technique for Schur complement systems arising in stochastic optimization ⋮ Unnamed Item ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ Lexicographic maximin optimisation for fair bandwidth allocation in computer networks ⋮ Accelerated multigrid for graph Laplacian operators ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ Experiments with a hybrid interior point/combinatorial approach for network flow problems ⋮ A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks ⋮ An accelerated L-shaped method for solving two-stage stochastic programs in disaster management ⋮ Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning ⋮ Interior-point solver for convex separable block-angular problems ⋮ IPM ⋮ Novel preconditioners for the iterative solution to FE-discretized coupled consolidation equations ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ Minimum-distance controlled perturbation methods for large-scale tabular data protection ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners ⋮ About Lagrangian methods in integer optimization
Uses Software
