Solving a Huff-like Stackelberg location problem on networks
This work deals with a Huff-like Stackelberg problem where the leader wants to locate a facility so that its profit is maximal after the competitor (the follower) has built its facility. We assume that the follower makes a rational decision, maximizing its own profit. The inelastic demand is aggrega...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2016
|
| Sorozat: | JOURNAL OF GLOBAL OPTIMIZATION
64 No. 2 |
| doi: | 10.1007/s10898-015-0368-2 |
| mtmt: | 2989523 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/18140 |
| Tartalmi kivonat: | This work deals with a Huff-like Stackelberg problem where the leader wants to locate a facility so that its profit is maximal after the competitor (the follower) has built its facility. We assume that the follower makes a rational decision, maximizing its own profit. The inelastic demand is aggregated into the vertices of a graph, and facilities can be located along the edges. For this computationally hard problem we give a Branch and Bound algorithm using interval analysis and DC bounds. Our computational experience shows that the problem can be solved on medium sized networks in reasonable time. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 233-247 |
| ISSN: | 0925-5001 |