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 12 of 12 for “"covering problems"”.
-
Coloring and covering problems on graphs
… is $K_{m,m,m}$. We also consider analogous problems for circular orderings, where pairs of nonincident edges are separated unless their endpoints alternate. Let $\pi^\circ(G)$ be the number of circular orderings needed to separate all pairs, and let $\pi_f^\circ(G)$ be the fractional …
-
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 …
-
Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients
… is to devise a procedure to generate random Set Covering Problem (SCP) instances with known optimal solutions and correlated coefficients. The procedure presented in this work can generate a virtually unlimited number of SCP instances with known optimal solutions and realistic characteristics, …
-
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 …
-
Probabilistic methods in combinatorial and stochastic optimization
(cont.) Packing/Covering problems, we prove upper and lower bounds on the adaptivity gap depending on the dimension. We also design polynomial-time algorithms achieving near-optimal approximation guarantees with respect to the adaptive optimum. Finally, we prove complexity-theoretic results …
-
On the topology of the spaces of coverings
The spaces of coverings (SoC) arise from various configuration spaces of the covering problems. We study the topology of these spaces for different domains and covering agents. In particular, we study the SoCs for grid domains and metric trees covered by balls. Characterizations of their topology …
-
Fast approximations for combinatorial optimization via multiplicative weight updates
… running times for explicit mixed packing and covering problems, nearly linear time approximations for tree packings, nearly linear time approximations for the Held Karp bound (leading to a significantly faster $(3/2 + \epsilon)$-approximation for metric TSP), faster approximations for covering …
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
… it is often common to see a dual analysis of problems that can be formulated as a linear or convex program. Primal-dual and dual-fitting techniques have been successfully applied to many such problems. Unfortunately, the usual tricks come short in an online setting since an online algorithm …
-
DeepGridMCLP: A Deep Reinforcement Learning Approach to Solve the Maximal Covering Location Problem with Facilities in Continuous Regions
<p>The Maximal Covering Location Problem (MCLP) is a classic Combinatorial Optimization Problem (COP) in spatial optimization and operations research, predominatnly used for strategic public facility placement. The model’s objective is to determine the optimal locations for a fixed number of …
-
Abstraction and application: complementary perspectives on sociotechnical systems
… use. It begins with classical metric clustering problems such as k-center and facility location, which often underpin machine learning and resource allocation algorithms where real-world concerns such as fairness have become especially relevant. The first two chapters develop constant-factor …
-
ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ
… BELONGS TO THE WELL KNOWN CATEGORY OF NP-HARD PROBLEMS AND UNTIL NOW IT IS TACKLED UNDER THE FRAMEWORK OF THESET COVERING PROBLEM (SCP). IN THIS THESIS THE PROBLEM (F) IS SOLVED UNDER THEFRAMEWORK OF THE THEORY OF EXTERNALLY STABLE SETS (ESS) OF GRAPH THEORY. THE THESIS CONSIST OF SIX CHAPTERS. …