Art der Publikation: Beitrag in Zeitschrift

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

Autor(en):

Kress, D.; Pesch, E.

Titel der Zeitschrift:

Computers & Operations Research

Jahrgang (Veröffentlichung):

39 (2012)

Heftnummer:

12

Seiten:

2954-2967

Sprache:

Englisch

Schlagworte:

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

Digital Object Identifier (DOI):

doi:10.1016/j.cor.2012.02.025

Volltext:

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

Zitation:

Download BibTeX

Kurzfassung

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.