شماره ركورد كنفرانس :
4214
عنوان مقاله :
Combinatorial Algorithms formaximum-profit inverse median location problems
پديدآورندگان :
Alizadeh Behrooz Sahand University of Technology,Tabriz , Afrashteh Esmaeil Sahand University of Technology,Tabriz , Baroughi Fahimeh Sahand University of Technology,Tabriz , Nguyen KienTrung Cantho University, Cantho, Vietnam
كليدواژه :
median location problem , combinatorial optimization , maximum , profit inverse optimization , timecomplexity.
عنوان كنفرانس :
دهمين كنفرانس بين المللي تحقيق در عمليات
چكيده فارسي :
This paper is concerned with a new variant of the inversemedian location problem in which the aim is to modify the customerweights such that a predetermined facility location becomes a medianlocation and the total profit obtained via the weight improvements ismaximized. We develop novel combinatorial approaches with linear timecomplexities for solving the problem on tree networks and in the planeunder the rectilinear and Chebyshev norms.
