Cited in
(56)- Multicommodity network flows: A survey. II: Solution methods
- Minimum-distance controlled perturbation methods for large-scale tabular data protection
- Large-scale optimization with the primal-dual column generation method
- Interior point methods 25 years later
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- Solving Real-World Linear Programs: A Decade and More of Progress
- Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
- Existence, uniqueness, and convergence of the regularized primal-dual central path
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- Computational experience with a parallel implementation of an interior-point algorithm for multicommodity network flows
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- An augmented Lagrangian algorithm for large scale multicommodity routing
- An accelerated L-shaped method for solving two-stage stochastic programs in disaster management
- scientific article; zbMATH DE number 2215848 (Why is no real title available?)
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- About Lagrangian methods in integer optimization
- Spectral analysis of (sequences of) graph matrices
- Preconditioning indefinite systems in interior point methods for optimization
- A simple method for improving the primal simplex method for the multicommodity flow problem
- Mathematical programming approaches for classes of random network problems
- Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
- Quadratic regularizations in an interior-point method for primal block-angular problems
- SPARSEM
- CORO
- HOPDM
- KORBX
- LIPSOL
- PCx
- PPRN
- PDNET
- MCFClass
- POSTS
- OOPS
- SpicyMKL
- Crash start of interior point methods
- A linear model for compound multicommodity network flow problems
- 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
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
- Algorithms for finding optimal flows in dynamic networks
- Solving L₁-CTA in 3D tables by an interior-point method for primal block-angular problems
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Tulip.jl
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
- An extended model and a column generation algorithm for the planar multicommodity flow problem
- Parallel interior-point solver for structured linear programs
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
- Prim-based support-graph preconditioners for min-cost flow problems
- Accelerated multigrid for graph Laplacian operators
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
- An interior-point approach for primal block-angular problems
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
This page was built for software: IPM
