The following pages link to KORBX (Q16520):
Displaying 50 items.
- The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- Parallel solution of large-scale, block-angular linear programs (Q751502) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Hypermatrix oriented supernode amalgamation (Q1009360) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer (Q1199098) (← links)
- An implementation of a parallel primal-dual interior point method for block- structured linear programs (Q1203072) (← links)
- A new steepest edge approximation for the simplex method for linear programming (Q1273430) (← links)
- Interior proximal point algorithm for linear programs (Q1321229) (← links)
- Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
- Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
- Partitioning mathematical programs for parallel solution (Q1380936) (← links)
- A smooth penalty function algorithm for network-structured problems (Q1388940) (← links)
- Solving difficult multicommodity problems with a specialized interior-point algorithm (Q1417769) (← links)
- An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
- Parallel search paths for the simplex algorithm (Q1642812) (← links)
- Customizing the solution process of COIN-OR's linear solvers with python (Q1694292) (← links)
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
- Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648) (← links)
- Presolving in linear programming (Q1914076) (← links)
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods (Q2012233) (← links)
- Novel update techniques for the revised simplex method (Q2352418) (← links)
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners (Q2356092) (← links)
- Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- MIP: Theory and practice -- closing the gap (Q2712822) (← links)
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
- (Q3102304) (← links)
- A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem (Q3116758) (← links)
- Interior Dual Least 2-Norm Algorithm for Linear Programs (Q3138073) (← links)
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks (Q3140000) (← links)
- (Q3348677) (← links)
- (Q3348699) (← links)
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation (Q3514841) (← links)
- A family of linear programming algorithms based on an algorithm by von Neumann (Q3632946) (← links)
- Solving Real-World Linear Programs: A Decade and More of Progress (Q3635048) (← links)
- An Interior Point Method for Block Angular Optimization (Q4012437) (← links)
- Progress Made in Solving the Multicommodity Flow Problem (Q4229456) (← links)
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem (Q4272892) (← links)
- Subgradient Methods for the Service Network Design Problem (Q4319316) (← links)
- Interior dual proximal point algorithm using preconditioned conjugate gradient † (Q4327905) (← links)
- Combining Interior-Point and Pivoting Algorithms for Linear Programming (Q4361490) (← links)
- (Q4375656) (← links)
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows (Q4509740) (← links)
- Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ (Q4819970) (← links)
