Advances in design and implementation of optimization software
From MaRDI portal
Recommendations
Cites work
- A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
- A general phase-I method in linear programming
- A new steepest edge approximation for the simplex method for linear programming
- A numerically exact implementation of the simplex method
- A practicable steepest-edge simplex algorithm
- A practical anti-cycling procedure for linearly constrained optimization
- A repository of convex quadratic programming problems
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Best “ordering” for floating-point addition
- Computational experience with a primal-dual interior point method for linear programming
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- CUTE
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Gigaflops in linear programming
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 1187125 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 46835 (Why is no real title available?)
- scientific article; zbMATH DE number 53772 (Why is no real title available?)
- scientific article; zbMATH DE number 3597833 (Why is no real title available?)
- scientific article; zbMATH DE number 604445 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- scientific article; zbMATH DE number 1064583 (Why is no real title available?)
- scientific article; zbMATH DE number 1097351 (Why is no real title available?)
- scientific article; zbMATH DE number 960151 (Why is no real title available?)
- Implementation of an integer optimization platform using object oriented programming
- Implementing interior point linear programming methods in the Optimization Subroutine Library
- Implementing the simplex method for the Optimization Subroutine Library
- Implementing the Simplex Method: The Initial Basis
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor
- New crash procedures for large systems of linear constraints
- New Finite Pivoting Rules for the Simplex Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Automatic Scaling of Matrices for Gaussian Elimination
- On the Implementation of a Primal-Dual Interior Point Method
- Pivot selection methods of the Devex LP code
- Precise computation using range arithmetic, via C++
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Presolving in linear programming
- Software Libraries for Linear Algebra Computations on High Performance Computers
- Steepest-edge simplex algorithms for linear programming
- Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- The Composite Simplex Algorithm
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Vector processing in simplex and interior methods for linear programming
Cited in
(8)- Implementation of an integer optimization platform using object oriented programming
- DistOpt: A software framework for modeling and evaluating optimization problem solutions in distributed environments
- Parallel search paths for the simplex algorithm
- scientific article; zbMATH DE number 1475703 (Why is no real title available?)
- Software development for global optimization
- scientific article; zbMATH DE number 970553 (Why is no real title available?)
- EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity
- Efficient GPU-based implementations of simplex type algorithms
Describes a project that uses
Uses Software
This page was built for publication: Advances in design and implementation of optimization software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598765)
