(r|p)-centroid problems on networks with vertex and edge demand

Kress, Dominik; Pesch, Erwin

doi:10.1016/j.cor.2012.02.025

(r|p)-centroid problems on networks with vertex and edge demand

Publication date

2012-03-05

Document type

Forschungsartikel

Author

Kress, Dominik

Pesch, Erwin

Organisational unit

Universität Siegen

DOI

10.1016/j.cor.2012.02.025

URI

https://openhsu.ub.hsu-hh.de/handle/10.24405/22249

Scopus ID

2-s2.0-84862979753

Publisher

Elsevier

Series or journal

Computers & Operations Research

ISSN

0305-0548

Periodical volume

39

Periodical issue

12

First page

2954

Last page

2967

Peer-reviewed

✅

Part of the university bibliography

Nein

Language

English

Keyword

Bilevel programming

Centroid

Competitive location

Edge demand

Location

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.

Version

Published version

Access right on openHSU

Metadata only access