(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 in:Computers & operations research 2012-12, Vol.39 (12), p.2954-2967
Main Authors: Kress, Dominik, Pesch, Erwin
Format: Article
Language:English
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2012.02.025