The following pages link to IPM (Q17310):
Displayed 43 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Mathematical programming approaches for classes of random network problems (Q319592) (← links)
- Crash start of interior point methods (Q323526) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- Existence, uniqueness, and convergence of the regularized primal-dual central path (Q613327) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (Q895654) (← links)
- Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning (Q1010307) (← links)
- Parallel interior-point solver for structured linear programs (Q1404236) (← links)
- An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
- Preconditioning indefinite systems in interior point methods for optimization (Q1876589) (← links)
- Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems (Q1948525) (← links)
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
- An accelerated L-shaped method for solving two-stage stochastic programs in disaster management (Q2288985) (← links)
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks (Q2455638) (← links)
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving (Q2573394) (← links)
- Minimum-distance controlled perturbation methods for large-scale tabular data protection (Q2576244) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- Prim-based support-graph preconditioners for min-cost flow problems (Q2643617) (← links)
- A linear model for compound multicommodity network flow problems (Q2654399) (← links)
- (Q2712824) (← links)
- Spectral Analysis of (Sequences of) Graph Matrices (Q2784350) (← links)
- Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems (Q2884565) (← links)
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
- Algorithms for Finding Optimal Flows in Dynamic Networks (Q2974407) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM (Q3391969) (← links)
- An extended model and a column generation algorithm for the planar multicommodity flow problem (Q3593364) (← links)
- Solving Real-World Linear Programs: A Decade and More of Progress (Q3635048) (← links)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems (Q4427382) (← links)
- (Q5020878) (← links)
- A new interior-point approach for large separable convex quadratic two-stage stochastic problems (Q5043842) (← links)
- On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems (Q5348470) (← links)
- A simple method for improving the primal simplex method for the multicommodity flow problem (Q5433193) (← links)
- (Q5696633) (← links)
- A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)