Linear Programming on Cray Supercomputers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4199963
- Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
- Parallel solution of large-scale, block-angular linear programs
- Large-scale 0-1 linear programming on distributed workstations
Cited in
(14)- Experiments with parallel branch-and-bound algorithms for the set covering problem
- A dual strategy for solving the linear programming relaxation of a driver scheduling system
- 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
- scientific article; zbMATH DE number 4199963 (Why is no real title available?)
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
- scientific article; zbMATH DE number 4096771 (Why is no real title available?)
- scientific article; zbMATH DE number 706866 (Why is no real title available?)
- Nash balanced assignment problem
- Exact and heuristic algorithms for the interval data robust assignment problem
- Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
- Linear programming on a micro - The case of the Apple II
- Towards a practical parallelisation of the simplex method
This page was built for publication: Linear Programming on Cray Supercomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035131)
