(r|p)-centroid problems on networks with vertex and edge demand |
| |
Authors: | Dominik Kress Erwin Pesch |
| |
Affiliation: | Department of Management Information Sciences, University of Siegen, Hölderlinstraße 3, D-57068 Siegen, Germany |
| |
Abstract: | This paper analyzes (r|p)-centroid problems on networks with vertex and edge demand under a binary choice rule. Bilevel programming models are presented for the discrete problem class. Furthermore, NP-hardness proofs for the discrete and continuous (1|p)-centroid problem on general networks with edge demand only are provided. Nevertheless, an efficient algorithm to determine a discrete (1|p)-centroid of a tree network with vertex and edge demand can be derived. |
| |
Keywords: | Location Competitive location Centroid Edge demand Bilevel programming |
本文献已被 ScienceDirect 等数据库收录! |