Article ID: | iaor199853 |
Country: | United Kingdom |
Volume: | 24 |
Issue: | 6 |
Start Page Number: | 549 |
End Page Number: | 557 |
Publication Date: | Jun 1997 |
Journal: | Computers and Operations Research |
Authors: | Solanki Rajendra S., Gorti Jyothi K. |
Keywords: | programming: integer |
A wide range of integer optimization formulations have been successfully used in a variety of applications dealing with distribution, production, finance, and a host of other areas. Since the general integer optimization problem is NP-complete, specialized theory and techniques have evolved to utilize the special structures in individual applications. This has led to different categories and sub-categories of techniques that need to be evaluated in selecting a solution strategy for a new integer optimization formulation. The availability of computer packages or callable libraries for only a few techniques results in the need to either modify an existing code or implement a new code from scratch. This article illustrates the utility of object oriented programming methodology in implementing a modular, reusable library of techniques that can be extended easily to develop code for solving new integer optimization formulations. The flexibility in the library allows for easy customization of existing techniques for new applications as well as development of new techniques that utilize the code in the existing library. The ease of customization or reusability of this library is depicted by comparing it with the code written in conventional programming languages, such as Fortran or C.