Cheaper Jacobians by simulated annealing. (English) Zbl 1055.90092
The author applies simulated annealing to the vertex elimination problem In linearized c-graphs for generating nearly optimal Jacobian code.
Reviewer: Hang Tong Lau (St. Laurent/Quebec)
MSC:
| 90C59 | Approximation methods and heuristics in mathematical programming |
| 26B10 | Implicit function theorems, Jacobians, transformations with several variables |
| 90C27 | Combinatorial optimization |
