In interval scheduling, not only the processing times of the jobs but also their starting times are given. This paper surveys the area of interval scheduling and presents proofs of results that haveâ€¦ (More)

In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. Weâ€¦ (More)

In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satisÂ®ed by expanding cable capacities and/or installing concentrators in theâ€¦ (More)

As the name suggests genetic algorithms are motivated by the theory of evolution, see [S, 9, 19,25,27]. In contrast to local search algorithms such as simulated annealing [l] and tabu search [6,7],â€¦ (More)

In this paper, we describe a computational study to solve hard partial constraint satisfaction problems (PCSPs) to optimality. The PCSP is a general class of problems that contains a diversity ofâ€¦ (More)

In this paper we describe a new lower bound procedure for the minimum interference frequency assignment problem (MI-FAP). In the MI-FAP we have to assign frequencies to transmitter-receiver pairs inâ€¦ (More)