A linear time algorithm for inverse obnoxious center location problems on networks

For an inverse obnoxious center location problem, the edge lengths of the underlying network have to be changed within given bounds at minimum total cost such that a predetermined point of the network becomes an obnoxious center location under the new edge lengths. The cost is proportional to the in...

Full description

Saved in:
Bibliographic Details
Published in:Central European journal of operations research 2013-09, Vol.21 (3), p.585-594
Main Authors: Alizadeh, Behrooz, Burkard, Rainer E.
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Business and Management
Combinatorial optimization
Computational mathematics
Cost engineering
Graphs
Industrial locations
Inverse
Investigations
Methods
Networks
Operations research
Operations Research/Decision Theory
Optimization
Original Paper
Position (location)
Running
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:For an inverse obnoxious center location problem, the edge lengths of the underlying network have to be changed within given bounds at minimum total cost such that a predetermined point of the network becomes an obnoxious center location under the new edge lengths. The cost is proportional to the increase or decrease, resp., of the edge length. The total cost is defined as sum of all cost incurred by length changes. For solving this problem on a network with m edges an algorithm with running time is developed.
ISSN:1435-246X
1613-9178
DOI:10.1007/s10100-012-0248-5