نتایج جستجو برای: median p
تعداد نتایج: 1353968 فیلتر نتایج به سال:
In this paper, we introduce, study and analyze several classes of compact formulations for the symmetric Hamiltonian p $$ -median problem (H MP). Given a positive integer weighted complete undirected graph G = ( V , E ) G=\left(V,E\right) with weights on edges, H MP is to find minimum weight set elementary cycles partitioning vertices . The advantage developing that they can be readily used in ...
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید