Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 75 for “"Covering problem"”.
-
Covering problem with minimum radius enclosing circle
… extends the classical smallest enclosing circle problem in location science to optimize healthcare communication hubs. Given a set of demand points and potential groups, we identify the optimal number of subgroups to cover all points and the circle enclosing them with minimum radius. The center …
-
Conditional covering problem: Study of complexity and optimization methods
The Conditional Covering Problem (CCP) is a facility location problem on a graph, where the set of nodes represents the demand points and the potential facility locations. The CCP minimizes the sum of the facility location costs required to cover all demand points. The key aspect of the CCP is that …
-
Topology sensitive algorithms for large scale uncapacitated covering problem
Solving NP-hard facility location problems in wireless network planning is a common scenario. In our research, we study the Covering problem, a well known facility location problem with applications in wireless network deployment. We focus on networks with a sparse structure. First, we analyzed two …
-
The local covering problem: producing and certifying local coverings
The covering problem is a classical type of problem that is concerned with finding the smallest collection of structures such that a larger structure is covered. In this thesis we focus on a few examples of the local covering problem, which can be described by the following goal: Given a connected …
-
On Hadwiger covering problem in five- and six-dimensional Euclidean spaces
… by Papadoperakis, which essentially reduces the problem to the study of covering of $(n-2)$-dimensional faces of an $n$-dimensional cube by parallelepipeds of a particular form. A step in the construction of the required covering uses computer assistance. We also study limitations of this …
-
A Graph Convolutional Network approach for enhancing Set Covering Problem solvers
The Set Covering Problem (SCP) is an NP-hard combinatorial optimization problem with applications in telecommunication, logistics, and transportation. Solving SCP is computationally challenging due to the combinatorial explosion of potential solutions, particularly for large instances. This study …
-
Exploring various set covering problem techniques to tackle the optimal camera placement problem
Optimal Camera Placement (OCP) problem is a combinatorial optimization problem, where the aim is to find an optimal placement of cameras, given that a target area is completely covered. A single-objective OCP is commonly formulated in two possible ways. The first one is to maximize the area …
-
The Minimal Covering Problem and Automated Design of Two-Level And/or Optimal Networks
Made available in DSpace on 2014-12-13T18:02:09Z (GMT). No. of bitstreams: 1 7913670.pdf: 5562102 bytes, checksum: 2cde600c6cc8bfc818b3ab4b5d311c11 (MD5) Previous issue date: 1978
-
Milk Collection Problem: Integrating the Traveling Salesman and Set Covering Problem - A Case Study in West Virginia, USA
… damaged. This research investigates a novel problem of collecting raw milk from a rural network of dairy farms. The research problem is grounded in a real scenario of milk collection in West Virginia, USA. The milk in this scenario is produced by small farms incapable of realizing …
-
Generalized total and partial set covering problems
… with the development of two generalized set covering models. The first model is formulated for the total set covering problem where cost is minimized subject to the constraint that each customer must be served by at least one facility. The second model is constructed for the partial set …
-
Bus crew scheduling using mathematical programming
… Ltd. The background to the bus crew scheduling problem 1S described and the existing literature on methods for solution is reviewed. In IMPACS, the crew scheduling problem is formulated as an integer linear programme using a formulation which is an extension of set covering; a very large set of …
-
Template Lattices for a Cross- Correlation Search for Continuous Gravitational Waves from Scorpius X-1
The lattice covering problem can be applied to the placement of templates in a search for continuous gravitational waves from the low-mass X-Ray binary Scorpius X-1. Efficient placement of templates to cover the parameter space at a given maximum mismatch is an application of the sphere covering …
-
Russian doll search algorithms for discrete optimization problems
… search algorithms for discrete optimization problems. The search space of the problems is pruned by determining different lower or upper bounds for the solution of the problem. In some cases, redundant candidates can be pruned on the basis of structural symmetry. One effective approach to …
-
Fault covers in reconfigurable VLSI chips
… to replace the defective elements. The fault covering problem is to assign the redundant elements to the defective elements such that the chip will function properly. We studied fault covering problems on special architectures, Random Access Memories and Programmable Logic Arrays, and …
-
Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods
… focus in this work investigates various set covering problem algorithms to use for selecting the optimal camera set. The trade-offs between solve time and quality of results are explored. The Carousel Greedy algorithm is found to be the best method for solving the problem due to its …
-
Decomposing rectilinear regions into rectangles
This thesis discusses the problem of decomposing rectilinear regions, with or without holes, into a minimum number of rectangles. There are two different types of decomposition considered here : decomposing a figure into non-overlapping parts, called partitioning, and decomposing a figure into …
-
Cocircuits of vector matroids
In this thesis, I present a set covering problem (SCP) formulation of the matroid cogirth problem, finding the cardinality of the smallest cocircuit of a matroid. Addressing the matroid cogirth problem can lead to significantly enhancing the design process of sensor networks. The solution to the …
Page 1 of 4