Advances in design and implementation of optimization software
type: Item
instance of: scholarly article
title: Advances in design and implementation of optimization software
zbMATH Open document ID: 1001.90004
DOI: 10.1016/S0377-2217(02)00072-3
author: István Maros
author: Mohammad Haroon Khaliq
published in: European Journal of Operational Research
publication date: 2002-05-28T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 1746210
zbMATH Keywords: large scale optimization
zbMATH Keywords: optimization software
zbMATH Keywords: implementation technology
describes a project that uses: MIPLIB
describes a project that uses: CUTEr
describes a project that uses: DEVEX
describes a project that uses: CUTE
describes a project that uses: NETLIB LP Test Set
describes a project that uses: MPI
describes a project that uses: AMPL
describes a project that uses: AIMMS
describes a project that uses: MINOS
describes a project that uses: PNM
describes a project that uses: OSL
describes a project that uses: Decision tree for optimization software
MaRDI profile type: Publication
cites work: Precise computation using range arithmetic, via C++
cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
cites work: Q4347846
cites work: Presolving in linear programming
cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
cites work: Q4299745
cites work: Implementing the Simplex Method: The Initial Basis
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: CUTE
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: On the Automatic Scaling of Matrices for Gaussian Elimination
cites work: Q3844775
cites work: Software Libraries for Linear Algebra Computations on High Performance Computers
cites work: Q3740904
cites work: Vector processing in simplex and interior methods for linear programming
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Implementing interior point linear programming methods in the Optimization Subroutine Library
cites work: Implementing the simplex method for the Optimization Subroutine Library
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: A practicable steepest-edge simplex algorithm
cites work: Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
cites work: Q4355914
cites work: New crash procedures for large systems of linear constraints
cites work: A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
cites work: Pivot selection methods of the Devex LP code
cites work: Q4164776
cites work: Q4003964
cites work: Q3996990
cites work: Gigaflops in linear programming
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
cites work: A general phase-I method in linear programming
cites work: Q3840329
cites work: A numerically exact implementation of the simplex method
cites work: A repository of convex quadratic programming problems
cites work: Investigating the sparse simplex algorithm on a distributed memory multiprocessor
cites work: Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Q5687942
cites work: Q4372680
cites work: Best “ordering” for floating-point addition
cites work: Q4339096
cites work: Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
cites work: Implementation of an integer optimization platform using object oriented programming
cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
cites work: A new steepest edge approximation for the simplex method for linear programming
cites work: The Composite Simplex Algorithm
cites work: Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization