Efficient solution approaches for a discrete multi-facility competitive interaction model.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 38029844 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Efficient solution approaches for a discrete multi-facility competitive interaction model. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Aboolian%2C+Robert%22">Aboolian, Robert</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Berman%2C+Oded%22">Berman, Oded</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Krass%2C+Dmitry%22">Krass, Dmitry</searchLink><relatesTo>2</relatesTo><i> krass@rotman.utoronto.ca</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. Mar2009, Vol. 167 Issue 1, p297-306. 10p. 1 Chart. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Interactive+model+%28Communication%29%22">Interactive model (Communication)</searchLink><br /><searchLink fieldCode="DE" term="%22Knapsack+problems%22">Knapsack problems</searchLink><br /><searchLink fieldCode="DE" term="%22Integer+programming%22">Integer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+theory%22">Approximation theory</searchLink><br /><searchLink fieldCode="DE" term="%22Large+scale+systems%22">Large scale systems</searchLink><br /><searchLink fieldCode="DE" term="%22Experiments%22">Experiments</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=38029844 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10479-008-0337-y Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 297 Subjects: – SubjectFull: Interactive model (Communication) Type: general – SubjectFull: Knapsack problems Type: general – SubjectFull: Integer programming Type: general – SubjectFull: Approximation theory Type: general – SubjectFull: Large scale systems Type: general – SubjectFull: Experiments Type: general Titles: – TitleFull: Efficient solution approaches for a discrete multi-facility competitive interaction model. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Aboolian, Robert – PersonEntity: Name: NameFull: Berman, Oded – PersonEntity: Name: NameFull: Krass, Dmitry IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2009 Type: published Y: 2009 Identifiers: – Type: issn-print Value: 02545330 Numbering: – Type: volume Value: 167 – Type: issue Value: 1 Titles: – TitleFull: Annals of Operations Research Type: main |
| ResultId | 1 |
