Recently, the inverse connected p-median problem on block graphs G(V,E,w) under various cost functions, say rectilinear norm, Chebyshev norm, and bottleneck Hamming distance. Their contributions include finding a nece...
This paper is concerned with the problem of modifying the edge lengths of a weighted extended star network with n vertices by integer amounts at the minimum total cost subject to be given modification bounds so that a...
In this paper,we first consider the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain variables.The uncertainty distribution of the optimal o...
supported by National Natural Science Foundation of China (Grant Nos. 61751208, 61502510, 61773390);Outstanding Natural Science Foundation of Hunan Province (Grant No. 2017JJ1001);Special Program for the Applied Basic Research of National University of Defense Technology (Grant No. ZDYYJCYJ20140601)
Cardinality constrained optimization problems(CCOPs) are fixed-size subset selection problems with applications in several fields. CCOPs comprising multiple scenarios, such as cardinality values that form an interval,...