Linear Programming on Cray Supercomputers

DOI10.1057/JORS.1990.21zbMath0692.90065OpenAlexW1963658162MaRDI QIDQ3035131

John E. Beasley

Publication date: 1990

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1990.21

zbMATH Keywords

computational experienceCray super-computers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items (9)

A dual strategy for solving the linear programming relaxation of a driver scheduling system ⋮ Nash balanced assignment problem ⋮ Exact and heuristic algorithms for the interval data robust assignment problem ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ An algorithm for ranking assignments using reoptimization ⋮ A genetic algorithm for the project assignment problem ⋮ Towards a practical parallelisation of the simplex method ⋮ Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726] ⋮ Experiments with parallel branch-and-bound algorithms for the set covering problem

This page was built for publication: Linear Programming on Cray Supercomputers