شماره ركورد كنفرانس :
5263
عنوان مقاله :
EXACT ALGORITHMS FOR MAXIMUM-PROFIT INVERSE MEDIAN LOCATION OPTIMIZATION
پديدآورندگان :
Bagheri Sahar s_bagheri400@sut.ac.ir Department of Applied Mathematics, Sahand University of Technology, Tabriz , Alizadeh Behrooz alizadeh@sut.ac.ir Department of Applied Mathematics, Sahand University of Technology, Tabriz , Afrashteh Esmaeil afrashteh66@yahoo.com Department of Applied Mathematics, Sahand University of Technology, Tabriz
كليدواژه :
median location problem , combinatorial optimization , inverse optimization , time complexity
عنوان كنفرانس :
54 امين كنفرانس رياضي ايران
چكيده فارسي :
This paper is concerned with a new variant of the inverse median location problem in which the aim is to modify the customer weights such that a predetermined facility location becomes a median location and the total profit obtained via the weight improvements is maximized. We develop a novel combinatorial approaches with linear time complexities for solving the problem on tree networks and in the plane under the rectilinear norm. Our proposed approaches are the first exact linear time solution methods on this issue.
