This paper addresses a version of the single-facility Maximal Covering Location Problem on network where demand is: (i) distributed along edges and (ii) uncertain with only known interval estimation. To deal this problem, we propose minmax regret model service facility can be located anywhere network. problem is called Minmax Regret (MMR-EMCLP). Furthermore, present two polynomial algorithms fo...

The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

BACKGROUND Arsenic trioxide (ATO) is commonly used in the treatment of acute promyelocytic leukemia (APL), but does not benefit patients with solid tumors. When combined with other agents or radiation, ATO showed treatment benefits with manageable toxicity. Previously, we reported that metformin amplified the inhibitory effect of ATO on intrahepatic cholangiocarcinoma (ICC) cells more significa...

Algorithmic mechanism design deals with efficiently-computable algorithmic constructions in the presence of strategic players who hold the inputs to the problem and may misreport their input if doing so benefits them. Algorithmic mechanism design finds applications in a variety of internet settings such as resource allocation, facility location and e-commerce, such as sponsored search auctions....

The location set covering problem continues to be an important and challenging spatial optimization problem. The range of practical planning applications underscores its importance, spanning fire station siting, warning siren positioning, security monitoring and nature reserve design, to name but a few. It is challenging on a number of fronts. First, it can be difficult to solve for medium to l...

To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed to consider the capacity limits of facilities. However, most of these models assume only one fixed capacity level for the facility at each potential site. This assumption may limit the application of the capacitated MCLP. In this article, a modular capacitated maximal coveri...

This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents variables that can be partitioned into location and allocation decisions. This model is solved to optimality for small and medium-size instances. To tackle larger instances, a f...

Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting time constraints independently of the service's priority. This type of constraint is clearly inappropriate in many contexts. For example, in urban medical emergency services, calls that involve danger to human life deserve higher priority over calls for more routine inc...

one of the debates concerning concepts of “medial motion” and “traversal motion” is the question of which of these two concepts of motion corresponds to motion in the corporeal world. in the present article we intend to employ the language of mathematics to present a model for each of these two concepts to study the above mentioned problem. as a result, medial motion represents a covering funct...