Results 1 to 10 of about 282,015 (284)
Time-constrained maximal covering routing problem [PDF]
We introduce the time-constrained maximal covering routing problem (TCMCRP), as a generalization of the covering salesman problem. In this problem, we are given a central depot, a set of facilities and several customers which are located within a pre-determined coverage distance of available facilities.
Amiri, Afsaneh, Salari, Majid
openaire +4 more sources
The Capacitated Maximal Covering Location Problem Improves Access to Stroke Treatment: A Cross-Sectional Simulation Study [PDF]
Disparities in accessing advanced stroke treatment have been recognized as a policy challenge in multiple countries, including Japan, necessitating priority solutions.
Kyohei Bando +7 more
doaj +2 more sources
Large-scale influence maximization via maximal covering location [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Evren Güney +3 more
openaire +5 more sources
The distribution or delivery process is one factor that affect customer satisfaction as the goal of supply chain. In order for supply chain to be competitive in competition, delivery time is an important factor to manage, so that it could provide high ...
Rainisa Maini Heryanto, Santoso Santoso
doaj +1 more source
Cones generated by a generalized fractional maximal function [PDF]
The paper considers the space of generalized fractional-maximal function, constructed on the basis of a rearrangement-invariant space. Two types of cones generated by a nonincreasing rearrangement of a generalized fractional-maximal function and ...
N.А. Bokayev +2 more
doaj +2 more sources
Using quantum computing to solve the maximal covering location problem
In this article, we present the process and results of using quantum computing (QC) to solve the maximal covering location problem proposed by Church and ReVelle.
Alejandro Giraldo-Quintero +3 more
doaj +1 more source
This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning
Roghayyeh Alizadeh, Tatsushi Nishi
doaj +1 more source
Partial Evaluation and Efficient Discarding for the Maximal Covering Location Problem
The maximal covering location problem attempts to locate a limited number of facilities in order to maximize the coverage over a set of demand nodes. This problem is NP-Hard and it has been often addressed by using metaheuristics, where the execution ...
Cynthia Porras +3 more
doaj +1 more source
Modeling and solving the dynamic modular capacitated maximal covering location problem [PDF]
Maximal covering location problem is one of the most important network location problems that is used in various applications. To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed ...
Jafar Bagherinejad +2 more
doaj +1 more source
A Multi-Objective Model for Location-Routing Problem Considering Minimal Risk and Maximal Demand Covering [PDF]
Location, routing and allocation decisions in supply chain management philosophy is undoubtedly one of the most important issues have very effect on the supply chain cost reduction and customer satisfaction.
alireza alinezhad +2 more
doaj +1 more source

