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 31 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 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)

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

  4. 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 Repository record for Bus crew scheduling using mathematical programming (opens in a new tab)

  5. 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 Repository record for Column generation approaches to bus driver scheduling (opens in a new tab)

  6. An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income

    … have been found out. The first level uses Set Covering methodology to obtain the location.The second level uses Analytical Hierarchy Process to obtain the location. This Problem finds the location for two levels of distribution center for the state of Ohio.

    ohiolink Repository record for An Integrated Optimization Model for Distribution Center Location with Considerations of Population and Income (opens in a new tab)

  7. RFID Antenna Coverage Optimization

    … is minimized. We formulate the problem as a Set Covering optimization problem. We develop a heuristic algorithm for this NP-Complete problem. We also develop a computerized system, RFIDMIN, which enables for the automated calculation of the minimum number and location of RFID antennas, given …

    calpoly Repository record for RFID Antenna Coverage Optimization (opens in a new tab)

  8. Fuzzy Evolutionary Approaches for Bus and Rail Driver Scheduling

    … each of which is serviced by one vehicle, into a set of legal driver shifts. The main objectives are to minimise the total number of shifts and the total shift cost. Restrictions imposed by logistic, legal and union agreements make the problem more complicated. The generate-and-select approach is …

    whiterose Repository record for Fuzzy Evolutionary Approaches for Bus and Rail Driver Scheduling (opens in a new tab)

  9. A Constraint Programming Pre-processor for Duty Scheduling

    … driver scheduling problem involves assigning a set of drivers to cover all available bus work such that every bus is assigned a driver, the number of duties is minimised and each duty conforms to the rules governing them regarding maximum driving time and so on. Generally this problem is solved …

    whiterose Repository record for A Constraint Programming Pre-processor for Duty Scheduling (opens in a new tab)

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

    … to solve such problems is to generate the exact set of Pareto efficient solutions. However, if the problem is combinatorial, generating the exact set of Pareto efficient solutions can be challenging. This dissertation is dedicated to Multi-objective Combinatorial Optimization problems and their …

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

  11. Impact of Typhoons on Children's Human Capital Investments in Filipino Households

    … Philippines and a unique Filipino typhoon data set covering they years 1989-2008 to explore how typhoons affect household allocation of basic human capital investments, such as breastfeeding duration. Using OLS estimation and a distributed lag model, I find that children are significantly …

    usfca Repository record for Impact of Typhoons on Children's Human Capital Investments in Filipino Households (opens in a new tab)

  12. Location optimization for vaccination centers of the andean region in Peru

    … location is presented taking as a reference the Set Covering, Maximal Covering and P- Median models. Coverage, location costs and travel distance were prioritized. The sample used was the district of Kimbiri in Cusco. Of the seventy rural communities and nine health centers available, 55 and 7 …

    lima Repository record for Location optimization for vaccination centers of the andean region in Peru (opens in a new tab)

  13. Computational experiments for local search algorithms for binary and mixed integer optimization

    … in solving large, dense instances of both set covering and set packing problems.

    mit Repository record for Computational experiments for local search algorithms for binary and mixed integer optimization (opens in a new tab)

  14. The impact of equity-based remuneration on corporate risk strategy in the Australian mining sector

    … mining sector. The study uses a pooled data set covering the ten year period 2004 to 2013. This comprises mining sector companies listed on the Australian Stock Exchange.

    adelaide Repository record for The impact of equity-based remuneration on corporate risk strategy in the Australian mining sector (opens in a new tab)

  15. Factors Affecting Technology Adoption and Productivity in a Digital Era: a Framework Based on Literature Review and Future Agenda

    … Zephyr, D&B Hoovers, and Ci Technology Data Set covering large manufacturing companies in the U.S., it is found that the more employees feel they are learning something in their work, the higher their adoption of technology will be. Surprisingly, however, no relationship is found between …

    mit Repository record for Factors Affecting Technology Adoption and Productivity in a Digital Era: a Framework Based on Literature Review and Future Agenda (opens in a new tab)

  16. Query selection in Deep Web Crawling

    … three parts: 1) Query selection in an omniscient setting where the global data of the deep web are available. In this case, query selection is mapped to the set-covering problem. A weighted greedy algorithm is presented to target the log-normally distributed data. 2) Sampling-based query selection …

    windsor Repository record for Query selection in Deep Web Crawling (opens in a new tab)

  17. A methodology for locating fire stations at airports

    … 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 Atlanta Airport. In the first situation it is assumed that no fire stations exist at …

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

  18. Seismic sequence stratigraphy of the Lower Congo, Kwanza, and Benguela Basins, offshore Angola, Africa

    … principles, a 2D regional seismic data set covering three basins offshore Angola, the Lower Congo, Kwanza, and Benguela Basins, was interpreted. Sequences and their unconformities were correlated within each basin as well as between basins. Major sequences could be interpreted throughout …

    rice Repository record for Seismic sequence stratigraphy of the Lower Congo, Kwanza, and Benguela Basins, offshore Angola, Africa (opens in a new tab)

  19. Probabilistic formulations of some facility location problems in discrete space

    … to be examined is a probabilistic version of the set covering problem. The problem can be stated as follows: determine the locations of the minimum number of facilities among a discrete set of feasible location sites in order to assure that the probability each customer is covered by some facility …

    vt Repository record for Probabilistic formulations of some facility location problems in discrete space (opens in a new tab)

Page 1 of 2