메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject

Algorithm to decide Minimum New Store Positioning with Maximum Competitiveness
Recommendations
Search

최대 경쟁력을 갖는 최소 신설 점포위치 결정 알고리즘

논문 기본 정보

Type
Academic journal
Author
Lee, Sang-Un (강릉원주대학교 과학기술대학 멀티미디어공학과)
Journal
The Institute of Internet, Broading and Communication 한국인터넷방송통신학회 논문지 한국인터넷방송통신학회 논문지 제19권 제2호 KCI Accredited Journals
Published
2019.1
Pages
203 - 209 (7page)

Usage

cover
Algorithm to decide Minimum New Store Positioning with Maximum Competitiveness
Ask AI
Recommendations
Search

Abstract· Keywords

Report Errors
We will be establish the new $q(1{\leq}q{\leq}p-1)$ stores of firm $F_B$ to gain pop/(p+q) over rival firm $F_A$ that has already operate with p stores in a city of population pop. Han proposes inclusion-exclusion algorithm(IEA) that searches maximal pop top 5 location and select the maximum location take account of locate variation with increasing of $q=1,2,{\cdots},p-1$. This paper reduced the orignal graph into partial graph initially and search only q=1 node continually reduced in accordance with increasing $q=1,2,{\cdots},p-1$. If the final result is shown in the case of steel customer between q, the q locations farther separate in order to improve of solution. For the eleven experimental data, this algorithm is a relative simplicity and more optimal solution than Han's IEA.

Contents

No content found

References (8)

Add References

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Comments(0)

0

Write first comments.