Bandwidth reduction

A small Delphi application that can generate Sparse matrices of various sizes and densities (the Density of a sparse Matrix is the percent of non-zero elements is contains) and that features 3 (actually more like 2 ) bandwidth reduction algorithms My implementations of the CutHill-McKee Algorithm and of the genetic algorithm are by no means optimal (the genetic algorithm is also slightly modified). As such, both algorithms perform relatively poor (in terms of speed) compared with their creators` estimations. The main purpose of this project however, was to show that in the field of NP-complete problem solving, metaheuristic approaches, although considered rather slow, can be expected to produce results of very good quality.