Efficient solution approaches for a discrete multi-facility competitive interaction model.

Saved in:
Bibliographic Details
Title: Efficient solution approaches for a discrete multi-facility competitive interaction model.
Authors: Aboolian, Robert1, Berman, Oded2, Krass, Dmitry2 krass@rotman.utoronto.ca
Source: Annals of Operations Research. Mar2009, Vol. 167 Issue 1, p297-306. 10p. 1 Chart.
Subjects: Interactive model (Communication), Knapsack problems, Integer programming, Approximation theory, Large scale systems, Experiments
Abstract: In this paper, we present efficient solution approaches for discrete multi-facility competitive interaction model. Applying the concept of “Tangent Line Approximation” presented by the authors in their previous work, we develop efficient computational approaches—both exact and approximate (with controllable error bound α). Computational experiments show that the approximate approach (with small α) performs extremely well solving large scale problems while the exact approach performs very well for small to medium-sized problems. [ABSTRACT FROM AUTHOR]
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we present efficient solution approaches for discrete multi-facility competitive interaction model. Applying the concept of “Tangent Line Approximation” presented by the authors in their previous work, we develop efficient computational approaches—both exact and approximate (with controllable error bound α). Computational experiments show that the approximate approach (with small α) performs extremely well solving large scale problems while the exact approach performs very well for small to medium-sized problems. [ABSTRACT FROM AUTHOR]
ISSN:02545330
DOI:10.1007/s10479-008-0337-y