Type of Publication: Article in Journal

(r|p)-Centroid Problems on Networks with Vertex and Edge Demand

Author(s):

Kress, D.; Pesch, E.

Title of Journal:

Computers & Operations Research

Volume (Publication Date):

39 (2012)

Number of Issue:

12

pages:

2954-2967

Language:

Englisch

Keywords:

Location, Competitive location, Centroid, Edge demand, Bilevel programming

Digital Object Identifier (DOI):

doi:10.1016/j.cor.2012.02.025

Fulltext:

(r|p)-Centroid Problems on Networks with Vertex and Edge Demand (825 KB)

Citation:

Download BibTeX

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.