In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...