Pages that link to "Item:Q3035131"
From MaRDI portal
The following pages link to Linear Programming on Cray Supercomputers (Q3035131):
Displaying 8 items.
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726] (Q732917) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- A dual strategy for solving the linear programming relaxation of a driver scheduling system (Q1904740) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- A genetic algorithm for the project assignment problem (Q2485176) (← links)
