Local search and its variants simulated annealing and tabu search are widely used heuristics to approximately solve NP-hard optimization problems. To use local search one \simply" has to specify aâ€¦ (More)

Local search based heuristics have been demonstrated to give very good results for approximately solve the Quadratic Assignment Problem (QAP). In this paper, following the works of Weinberger andâ€¦ (More)

We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energyâ€¦ (More)

We consider the problem of designing truthful mechanisms for scheduling selfish tasks (or agents)â€”whose objective is the minimization of their completion timesâ€”on parallel identical machines in orderâ€¦ (More)

Meta-heuristics are a powerful way to approximately solve hard combinatorial optimization problems. However, for a problem, the quality of results can vary considerably from one instance to another.â€¦ (More)

Power management aims in reducing the energy consumed by computer systems while maintaining a good level of performance. One of the mechanisms used to save energy is the shutdown mechanism which putsâ€¦ (More)

In this paper, we consider the classical NP-complete VERTEX COVER problem in large graphs. We assume that the size and the access to the input graph impose the following constraints: (1) the inputâ€¦ (More)