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

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 edg...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 39; no. 12; pp. 2954 - 2967
Main Authors Kress, Dominik, Pesch, Erwin
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Ltd 01.12.2012
Elsevier
Pergamon Press Inc
Subjects
Algorithms
Applied sciences
Bilevel programming
Centroid
Competitive location
Computer simulation
Demand
Edge demand
Exact sciences and technology
Firm modelling
Location
Marketing
Mathematical models
Mathematical problems
Mathematical programming
Networks
Operational research and scientific management
Operational research. Management science
Operations research
Optimization algorithms
Programming
Studies
Competitive location
Centroid
Bilevel programming
Edge demand
Location
Tree(graph)
Center of mass
Competitiveness
NP hard problem
Localization
Modeling
Location problem
Online AccessGet full text
ISSN0305-0548
1873-765X
0305-0548
DOI10.1016/j.cor.2012.02.025

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2012.02.025