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 39 for “"Set Covering Problem"”.

  1. 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 …

    utc Repository record for A Graph Convolutional Network approach for enhancing Set Covering Problem solvers (opens in a new tab)

  2. 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 …

    lancaster Download PDF for Exploring various set covering problem techniques to tackle the optimal camera placement problem (opens in a new tab)

  3. 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 …

    wvu Repository record for Milk Collection Problem: Integrating the Traveling Salesman and Set Covering Problem - A Case Study in West Virginia, USA (opens in a new tab)

  4. 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 …

    whiterose Download PDF for Bus crew scheduling using mathematical programming (opens in a new tab)

  5. 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 …

    vt Repository record for Generalized total and partial set covering problems (opens in a new tab)

  6. Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods

    … A second 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 …

    byu Repository record for Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods (opens in a new tab) Download PDF for Camera View Planning for Structure from Motion: Achieving Targeted Inspection Through More Intelligent View Planning Methods (opens in a new tab)

  7. 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 …

    rice Repository record for Cocircuits of vector matroids (opens in a new tab)

  8. Computational advances in the solution of large-scale covering and set partitioning problems

    The Set Covering Problem (SCP) and the Set Partitioning Problem (SPP) represent an important class of all-binary (0-1) Integer Linear Programs (ILP). A review of the literature reveals extensive application of the SPP/SCP model to a wide set of practical problems. The basic model is explained, and …

    nps Repository record for Computational advances in the solution of large-scale covering and set partitioning problems (opens in a new tab)

  9. Design and analysis of algorithms for solving some stochastic vehicle routing and scheduling problems

    AbstractThis thesis addresses the vehicle routing problem with stochastic demands (VRPSD) and the multi-period time constrained traveling salesman problem (TCTSP). For the VRPSD, following a comparative study among heuristics available in the literature, we present three metaheuristics, simulated …

    nus Repository record for Design and analysis of algorithms for solving some stochastic vehicle routing and scheduling problems (opens in a new tab) Download file for Design and analysis of algorithms for solving some stochastic vehicle routing and scheduling problems (opens in a new tab)

  10. Multi-objective combinatorial optimization problems in transportation and defense systems

    "Multi-objective Optimization problems arise in many applications; hence, solving them efficiently is important for decision makers. A common procedure to solve such problems is to generate the exact set of Pareto efficient solutions. However, if the problem is combinatorial, generating the exact …

    must-thes Repository record for Multi-objective combinatorial optimization problems in transportation and defense systems (opens in a new tab)

  11. Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι

    The dissertation concerns design and analysis of set covering and network optimization algorithms.The content of the dissertation consists of three parts: Probabilistic Set Covering, Dynamic GraphAlgorithms, and Network Optimization. For the set covering problem we study the behavior of asimple …

    greece Repository record for Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι (opens in a new tab)

  12. Annual scheduling of Atlantic Fleet Naval Combatants

    … model to assist employment scheduling. A set covering formulation of the scheduling problem minimizes deviations from an "ideal" schedule, developed in terms of navy scheduling policy, while satisfying event requirements. An efficient column generation program, using problem-specific …

    nps Repository record for Annual scheduling of Atlantic Fleet Naval Combatants (opens in a new tab)

  13. Algorithms to Find the Girth and Cogirth of a Linear Matroid

    … and circuit respectively, of a linear matroid. A set covering problem (SCP) formulation of the problems is presented. The solution to the linear matroid cogirth problem provides the degree of redundancy of the corresponding sensor network, and allows for the evaluation of the quality of the …

    rice Repository record for Algorithms to Find the Girth and Cogirth of a Linear Matroid (opens in a new tab)

  14. Constraint sensitivity analysis of airline crew rostering using preferential bidding

    … their preferred overall schedule (roster). This problem is traditionally solved as an extension of the classical set covering problem. In this report, we present a preferential bidding-based set covering model with all the preferences are treated as hard constraints and perform a sensitivity …

    texas Repository record for Constraint sensitivity analysis of airline crew rostering using preferential bidding (opens in a new tab)

  15. SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM

    We consider the classic School Bus Routing Problem (SBRP) combined with alternate modes, where students are either picked up by a fleet of school buses subject to some constraints or transported by alternate transportation modes to a common destination (school). The constraints that are typically …

    cornell Repository record for SHAREABILITY NETWORK BASED DECOMPOSITION APPROACH FOR SOLVING THE LARGE-SCALE SCHOOL BUS ROUTING PROBLEM (opens in a new tab)

  16. Stochastic Combinatorial Optimization with Applications in Graph Covering

    … objective value function of the second-stage subproblems is submodular. Next, we consider risk-averse combinatorial optimization problems, where in one variant, the risk is measured with a chance constraint, and in another variant, conditional value-at-risk is used to quantify risk. We …

    washington Repository record for Stochastic Combinatorial Optimization with Applications in Graph Covering (opens in a new tab)

  17. A methodology for locating fire stations at airports

    … an initial continuous facility location problem into a discrete problem. By modeling the discrete formulation as a modified set covering problem, a solution is determined that meets the two guidelines. To illustrate the utility of the methodology, it is applied to two situations at the …

    vt Repository record for A methodology for locating fire stations at airports (opens in a new tab)

  18. Performance-oriented view planning for automated object reconstruction.

    … the model building process. The key open problem is to find an accurate, robust and efficient view planning algorithm---that is, the process of determining a suitable set of sensor viewpoints and imaging parameters for a specified reconstruction task with a given imaging environment. This …

    ottawa-retro Repository record for Performance-oriented view planning for automated object reconstruction. (opens in a new tab)

  19. Approximation in Multiobjective Optimization with Applications

    … much attention in solving real-life optimization problems in science, engineering, economics and other fields where optimal decisions need to be made in the presence of trade-offs between two or more conflicting objective functions. The conflicting nature of objective functions implies a solution …

    clemson Repository record for Approximation in Multiobjective Optimization with Applications (opens in a new tab)

Page 1 of 2