Title
Designing generic algorithms for operations research
Abstract
Design solutions have been proposed to implement generic data structures, however such techniques dedicated to algorithms are not well known. This article discusses various recurrent problems encountered when designing reusable, extensible algorithms for operations research. It explains how to use object-oriented concepts and the notion of genericity to design algorithms that are independent of the data structures and the algorithms they use, but that can still interact deeply with them. An object-oriented design is sometimes 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. It also discusses specific recurring design issues for operations research software and proposes solutions that improve the genericity of the algorithms. Copyright (c) 2005 John Wiley & Sons, Ltd.
Year
DOI
Venue
2006
10.1002/spe.682
SOFTWARE-PRACTICE & EXPERIENCE
Keywords
DocType
Volume
object-oriented design,operations research,algorithm implementation,genericity,reusability,design pattern
Journal
36
Issue
ISSN
Citations 
1
0038-0644
0
PageRank 
References 
Authors
0.34
1
3
Name
Order
Citations
PageRank
Bruno Bachelet1305.74
Antoine Mahul2203.60
Loïc Yon392.05