In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
The repair kit problem is that of finding the optimal set of parts in the kit of a repairman. An important aspect of this problem, in many real-life situations, is that several jo...
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...