Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

Summary: CCLP (Cancer Cell Line Profiler) is a webserver for the prediction of compound activity across the NCI60 panel. CCLP uses a multi-task Random Forest model trained on 941,831 data-points that integrates structural information from 17,142 compounds and multi-omics data sets from 59 cancer cell lines. In addition, CCLP also implements conformal prediction to provide individual prediction ...

Abstract In this article, we present the process and results of using quantum computing (QC) to solve maximal covering location problem proposed by Church ReVelle. With contribution, seek lay foundations for other urban regional scientists begin consider technologies. We obtained promising results, but it is clear that there a need more capable devices with qubits less susceptibility electronic...

This paper introduces a general modeling framework for multi-type maximal covering location problem in which the position of facilities different normed spaces are simultaneously decided to maximize demand generated by set points. From need intertwining decisions discrete and continuous sets, hybridized is considered some types be located finite sets others spaces. A natural non-linear model pr...

in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...