Set Covering Problem
Single Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
... This paper focuses on the hierarchical structure and set covering problem at the same time. In addition, we are approaching the actual situation by imposing capacity constraints to the problem ...
17
Set Covering Problem with Conflict Constraints.
... the set covering problem with conflict constraints, ...this problem may arise, we formulate the problem as an Integer Programming (IP) ...the set covering problem ...
139
Variation In Greedy Approach To Set Covering Problem
... weighted set covering problem is to choose a number of subsets to cover all the elements in a universal set at the lowest ...classical problem with applications in various fields like ...
70
A CLONALG-based Approach for the Set Covering Problem
... non-unicost set covering problem ...NP-hard problem that can model several real world situations such as crew scheduling in airlines, facility location problem, production planning in ...
9
On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes
... share set (the average information rate, or the worst information rate) can be obtained via solving some BIP ...BIP problem. And there is a close relationship between the problem of finding optimal ...
12
Allocating costs in set covering problems
... on set covering situations where a reasonable cover is given in ...related set covering problem has been solved either by means of an exact algorithm or by a heuristic or, the agents ...
26
Comparing Set-Covering Strategies for Optimal Corpus Design
... One alternative consists in explicitly controlling the con- tent of the learning corpus according to the target applica- tion. The main difficulty is to assure the presence of units longer than a phoneme, given their ...
6
Extensions to emergency vehicle location models
... Maximal Covering Location Problem (MCLP), which was presented by Church and Revelle ...the set covering problem models is that the demand node is covered if it is within the target time ...
18
Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem
... Chan et al. [12] have developed a branch and bound algorithm with multiplier adjustment for the traditional set-covering problem. Chaovalitwongse, Berger-Wolf, Das- gupta and Ashley [13] have ...
12
A Pareto metaheuristic for a bi objective winner determination problem in a combinatorial reverse auction
... determination problem that is based on the set covering problem and minimizes the total transport costs and the total transport quality ...this problem, the heuristic PNS was ...initial ...
27
The Potential Deployment Of Set Covering And Location-Assignment Model: The Case Of Locating Trauma Centers At The Midwest Region
... called set covering. The objective in a set covering problem is to minimize the number of members in set 2 that are needed to cover all the members in set ...1. Set ...
14
Crawling Deep Web using a GA-based set covering algorithm
... problem as a set covering problem, they used greedy method [7] [9] to select a proper.. set of queries based on a sample database.[r] ...
70
A Probabilistic Algorithm for the Solution of Homogeneous Linear Inequalities
... the set covering problem where each row of the set covering matrix corresponds to a sample point, and is determined by the constraint satisfaction at that sampled point, therefore the ...
58
Incorporating multiple ecological criteria in classical zero one selection algorithms
... the Set Covering Problem in selecting nature ...the set of alternative optimal solutions of the basic Set Covering Problem with no other criterion taken into account ...
8
Capacitated Single-Assignment Hub Covering Location Problem under Fuzzy Environment
... location problem is one of the most important issues in location problems because it is widely used in many telecommunication and transportation ...Hub covering problem can be used to model different ...
6
A Multi Objective Obnoxious Facility Location Modelon a Plane
... vertex covering obnox- ious facility location model has been designed with multi- ple ...The problem has been modeled as a pure planar location ...constraint set is that it might reduce the number of ...
7
Solving a large real world bus driver scheduling problem with a multi assignment based heuristic algorithm
... This section presents results for the BDSP modeled as a SCP. For small instances, the optimal value could be obtained by using ILP solver, whereas for large in- stances, lower bounds was computed using the subgradient ...
26
An Optimal Algorithm to Find a Minimum 2-neighbourhood Covering Set on Cactus Graphs
... Absttact. A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find minimum cardinality 2-neighbourhood-covering set on cactus ...
15
Comparing performance of different set-covering strategies for linguistic content optimization in speech corpora
... good covering of 2-phonemes (more than 30% of uncovered {1, 2}-phonemes in rand(30,000)), even for a size of a randomly designed corpus twice as great as the minimal covering ...3-phoneme covering ...
6
Solutions Problem Set 20XX
... There are four kinds of solutions. They are neutral ionic, neutral molecular, acid and base. Neutral molecular solutions : molecular compounds are dissolved in water to make a solution. [r] ...
29