KORBX

swMATH4341MaRDI QIDQ16520FDOQ16520

Author name not available (Why is that?)

Official website: https://pubsonline.informs.org/doi/10.1287/opre.38.2.240

Cited In (78)

• Preconditioning indefinite systems in interior point methods for large scale linear optimisation
• Solving Real-World Linear Programs: A Decade and More of Progress
• A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
• An Interior Point Method for Block Angular Optimization
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners
• SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
• Presolving in linear programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A new steepest edge approximation for the simplex method for linear programming
• Computational results of an interior point algorithm for large scale linear programming
• An augmented Lagrangian algorithm for large scale multicommodity routing
• A smooth penalty function algorithm for network-structured problems
• The scheduling of sparse matrix-vector multiplication on a massively parallel DAP computer
• Interior Dual Least 2-Norm Algorithm for Linear Programs
• Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
• Parallel search paths for the simplex algorithm
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• Novel update techniques for the revised simplex method
• Hypermatrix oriented supernode amalgamation
• Improving a primal–dual simplex-type algorithm using interior point methods
• The positive edge criterion within COIN-OR's CLP
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• Quadratic regularizations in an interior-point method for primal block-angular problems
• Title not available (Why is that?)
• PERMAS
• LIPSOL
• PCx
• PPRN
• PDNET
• IPM
• PyCOIN
• DEVEX
• NETGEN
• OSL
• SPLASH-2
• OOPS
• SIMPAR
• RELAX4
• Parallel solution of large-scale, block-angular linear programs
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs
• Interior dual proximal point algorithm using preconditioned conjugate gradient †
• YSMP
• PARSMI
• SYNPLEX
• PyCPX
• PyLPSolve
• CyLP
• ParISS
• Algorithm 836
• Title not available (Why is that?)
• Pannon Optimizer
• Interior dual proximal point algorithm for linear programs
• Interior proximal point algorithm for linear programs
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
• Towards a practical parallelisation of the simplex method
• A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem
• Solving difficult multicommodity problems with a specialized interior-point algorithm
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• Hyper-sparsity in the revised simplex method and how to exploit it
• An implementation of a parallel primal-dual interior point method for block- structured linear programs
• MIP: Theory and practice -- closing the gap
• Progress Made in Solving the Multicommodity Flow Problem
• Combining Interior-Point and Pivoting Algorithms for Linear Programming
• Efficient solution of two-stage stochastic linear programs using interior point methods
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
• Customizing the solution process of COIN-OR's linear solvers with python
• Subgradient Methods for the Service Network Design Problem
• A family of linear programming algorithms based on an algorithm by von Neumann
• Partitioning mathematical programs for parallel solution
• Title not available (Why is that?)
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
• Multicommodity network flows: The impact of formulation on decomposition
• An interior-point approach for primal block-angular problems
• Sparse hypermatrix Cholesky: customization for high performance
• Multicommodity network flows: A survey. II: Solution methods
• A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
• PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS

This page was built for software: KORBX