Results 11 to 20 of about 1,714,979 (285)
Uniform Random Covering Problems [PDF]
International Mathematics Research Notices, 2021 Abstract Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $\omega =(\omega _n)_{n\geq 1}$ uniformly distributed on the unit circle $\mathbb{T}$ and a sequence $(r_n)_{n\geq 1}$ of positive real ...
Koivusalo, Henna L L +2 more
openaire +5 more sources
Covering Graphs: The Covering Problem Solved
Journal of Combinatorial Theory, Series A, 1998 Let \(H\) be a fixed graph with \(h\) edges such that the gcd of all degrees of \(H\) is \(d\). The authors prove that for all \(n>n_0(H)\), where \(n_0(H)\) is enormous, the \(H\)-covering number of \(K_n\) is \(\left \lceil {dn\over 2h}\left \lceil {n-1 \over d} \right\rceil \right \rceil\) except for \(d\equiv 0\pmod 2\), \(n\equiv 1 \pmod d\), \(n ...
Caro, Yair, Yuster, Raphael
openaire +2 more sources
Frobenius problem and the covering radius of a lattice [PDF]
, 2006 Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are non-negative integers ...
Fukshansky, Lenny, Robins, Sinai
core +4 more sources
Applied Sciences, 2020 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
Using quantum computing to solve the maximal covering location problem
Computational Urban Science, 2022 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
Two meta-heuristics for solving the multi-vehicle multi-covering tour problem with a constraint on the number of vertices [PDF]
Yugoslav Journal of Operations Research, 2021 In this work we deal with a generalized variant of the multi-vehicle covering tour problem (m-CTP). The m-CTP consists of minimizing the total routing cost and satisfying the entire demand of all customers, without the restriction of visiting them all ...
Kammoun Manel +2 more
doaj +1 more source
The multimode covering location problem [PDF]
, 2016 In this paper we introduce the Multimode Covering Location Problem. This is a generalization of the Maximal Covering Location Problem that consists in locating a given number of facilities of different types with a limitation on the number of facilities ...
Colombo, Fabio +2 more
core +2 more sources
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
Algorithms, 2023 In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the ...
Tommaso Adamo +3 more
doaj +1 more source
Hub Covering Location Problem Considering Queuing and Capacity Constraints [PDF]
Journal of Optimization in Industrial Engineering, 2018 In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint ...
Mehdi Seifbarghy +2 more
doaj +1 more source