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

Robert Aboolian

doi:10.1007/s10479-008-0337-y

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

2008-03-29

22

PRE

AI

DOI：10.1007/s10479-008-0337-y

Original

Original request for help

Save

Abstract

En 中文

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 alpha). Computational experiments show that the approximate approach (with small alpha) performs extremely well solving large scale problems while the exact approach performs very well for small to medium-sized problems.

Keywords:

Competitive facility location

Spatial interaction models

Nonseparable convex knapsack problem

Approximation

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

Abstract

Journal

Organization