Advances in design and implementation of optimization software

Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Parallel search paths for the simplex algorithm ⋮ EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity ⋮ Efficient GPU-based implementations of simplex type algorithms

Uses Software

AMPL
CUTEr
MIPLIB
AIMMS
MINOS
PNM
MPI
DEVEX
OSL
NETLIB LP Test Set
Decision tree for optimization software
CUTE

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
New crash procedures for large systems of linear constraints
Vector processing in simplex and interior methods for linear programming
Computational experience with a primal-dual interior point method for linear programming
A general phase-I method in linear programming
A practical anti-cycling procedure for linearly constrained optimization
A new steepest edge approximation for the simplex method for linear programming
A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
Implementation of an integer optimization platform using object oriented programming
Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
Investigating the sparse simplex algorithm on a distributed memory multiprocessor
Steepest-edge simplex algorithms for linear programming
A numerically exact implementation of the simplex method
Presolving in linear programming
Gigaflops in linear programming
Best “ordering” for floating-point addition
A practicable steepest-edge simplex algorithm
On the Implementation of a Primal-Dual Interior Point Method
On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
An Implementation of a Primal-Dual Interior Point Method for Linear Programming
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
Implementing the Simplex Method: The Initial Basis
Analysis of mathematical programming problems prior to applying the simplex algorithm
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
New Finite Pivoting Rules for the Simplex Method
Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
Preprocessing and Probing Techniques for Mixed Integer Programming Problems
Implementing the simplex method for the Optimization Subroutine Library
Implementing interior point linear programming methods in the Optimization Subroutine Library
Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
CUTE
Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
Precise computation using range arithmetic, via C++
Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
A repository of convex quadratic programming problems
Software Libraries for Linear Algebra Computations on High Performance Computers
The Composite Simplex Algorithm
On the Automatic Scaling of Matrices for Gaussian Elimination
Pivot selection methods of the Devex LP code

This page was built for publication: Advances in design and implementation of optimization software