Designing generic algorithms for operations research

Design solutions have been proposed to implement generic data structures, however there is no technique that advanced for algorithms. This article discusses various problems encountered when designing reusable, extensible, algorithms for operations research. It explains how to use objectoriented concepts and the notion of genericity to design algorithms that are independent of the data structures and the algorithms they handle, but that can still interact deeply together. An objectoriented design is often considered to be less efficient than a classical one, and operations research is one of these scientific fields where efficiency really matters. Hence, the main goal of this article is to explain how to design algorithms that are both generic and efficient.