Exact algorithms for solving a bi-level location–allocation problem considering customer preferences
Abstract The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonl...
Main Authors: | Ehsan Mirzaei, Mahdi Bashiri, Hossein Shams Shemirani |
---|---|
Format: | Article |
Language: | English |
Published: |
Islamic Azad University
2019-01-01
|
Series: | Journal of Industrial Engineering International |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s40092-018-0302-6 |
Similar Items
-
Resource allocation in IT projects: using schedule optimization
by: Michael Chilton
Published: (2014-01-01) -
Resource allocation in IT projects: using schedule optimization
by: Michael A. Chilton
Published: (2022-02-01) -
When is an Incomplete 3 × n Latin Rectangle Completable?
by: Euler Reinhardt, et al.
Published: (2013-03-01) -
ANALYSIS OF AN ALLOCATION SCHEME WITH LIMITED STEPS AND ITS APLICATION FOR THE STUDY OF PERMUTATION DISPERSION
by: Natalya Enatskaya, et al.
Published: (2017-08-01) -
Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect
by: Yi-Chun Wang, et al.
Published: (2023-07-01)