895 search results - page 18 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
TCS
2008
14 years 10 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
103
Voted
SETN
2010
Springer
15 years 2 months ago
2010
Springer
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...
ESA
2003
Springer
15 years 3 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
ORL
2011
14 years 5 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
84
Voted
GECCO
2000
Springer
15 years 2 months ago
2000
Springer
This paper explores the application of multiobjective Genetic Algorithms (mGAs) to rural land use planning, a spatial allocation problem. Two mGAs are proposed. Both share an unde...