Skip to Main Content
It is usually impossible to exactly solve hard optimization problems. One is thus directed to iterative algorithms. In the implementation of these iterative algorithms, some common characteristics can be observed, which can be generalized in an object-oriented framework. This can significantly reduce the time needed for implementation of an iterative algorithm. This paper presents a class hierarchy, which can be used as an object-oriented framework for the solutions of iterative problems. Utilizing the options available in object-oriented languages, it separates the class interface from the implementation.