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 107 for “"Set covering"”.

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

  2. A STUDY ON LOCATION SET COVERING MODELS WITH TWO APPLICATIONS

    … THESIS FOCUSES ON TWO APPLICATIONS OF LOCATION SET COVERING (LSC) MODELS IN TWO PRACTICAL FIELDS: EMERGENCY MEDICAL SERVICE (EMS) SYSTEM AND GREEN SUPPLY CHAIN (GRSC) SYSTEM, IN ORDER TO PROVIDE INSIGHTS FOR THE POLICY-MAKERS OR MANAGERS. IN EMS SYSTEM, OUR GOAL IS TO MINIMIZE THE OVERALL COSTS …

    nus Repository record for A STUDY ON LOCATION SET COVERING MODELS WITH TWO APPLICATIONS (opens in a new tab) Download file for A STUDY ON LOCATION SET COVERING MODELS WITH TWO APPLICATIONS (opens in a new tab)

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

  4. Sample compression, margins and generalization: Extensions to the set covering machine

    … behavior of algorithms in Sample Compression Settings. It extends the study of the Sample Compression framework to derive data-dependent bounds that give tighter guarantees to the algorithms where data-independent bounds such as the VC bounds are not applicable. It also studies the interplay …

    ottawa-retro Repository record for Sample compression, margins and generalization: Extensions to the set covering machine (opens in a new tab)

  5. Exploring various set covering problem techniques to tackle the optimal camera placement problem

    … combinatorial optimization problem, namely, the Set Covering Problem (SCP). Thus, OCP can be formulated as SCP. However, a special variant of SCP is used in this paper. This variant is called the unicost SCP (USCP), where the cost is assumed to be unified and, therefore, not a factor. The reason …

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

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

    ucf Repository record for Simulation Of Random Set Covering Problems With Known Optimal Solutions And Explicitly Induced Correlations Amoong Coefficients (opens in a new tab)

  7. Milk Collection Problem: Integrating the Traveling Salesman and Set Covering Problem - A Case Study in West Virginia, USA

    … vehicle to not exceed the allowable time limit set to maintain the quality of the collected milk. This problem provides the unique opportunity to incorporate two separate classical optimization problems: the Set Covering Problem (SCP) (identifying depot locations) and the Traveling Salesman …

    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)

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

    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)

  9. Bus crew scheduling using mathematical programming

    … using a formulation which is an extension of set covering; a very large set of possible duties is generated, from which the duties forming the schedule are selected in such a way as to minimise the total cost. The variables of the set covering problem correspond to the duties generated and the …

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

  10. Column generation approaches to bus driver scheduling

    … description of one such system which uses a set covering model to produce a schedule from a set of previously generated valid duties. This method first solves the Linear Programming relaxation, and then uses Branch and Bound techniques to search for a good integer solution. Improvements to …

    whiterose Download PDF for Column generation approaches to bus driver scheduling (opens in a new tab)

  11. Integer Programming Methods for Boolean Interdiction Games

    … in which we developed several new tools: a set-covering formulation that interdicts all the critical spanning trees, a class of facets that enhances the efficiency of the searching procedure, and a family of special graph structures that results in a new solution method based on supervalid …

    buffalo Repository record for Integer Programming Methods for Boolean Interdiction Games (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. Constraint sensitivity analysis of airline crew rostering using preferential bidding

    … 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 analysis of the model by varying all the controllable parameters to …

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

Page 1 of 6