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 5 of 5 for “"SET COVERING PROBLEMS"”.

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

  3. Covering relaxation methods for solving the zero-one positive polynomial programming problem

    Covering relaxation algorithms were first developed by Granot et al for solving positive 0-1 polynomial programming (PP) problems which maximize a linear objective function in 0-1 variables subject to a set of polynomial inequalities containing only positive coefficients ["Covering Relaxation for …

    ubc Repository record for Covering relaxation methods for solving the zero-one positive polynomial programming problem (opens in a new tab) Download PDF for Covering relaxation methods for solving the zero-one positive polynomial programming problem (opens in a new tab)

  4. ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ

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

    greece Repository record for ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ (opens in a new tab)