GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
DGCI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
ISCAS
2005
IEEE
13 years 10 months ago
2005
IEEE
— In this paper we provide a survey of three classes of combinatorial optimization problems that arise in communication network analysis. These problems, referred to as QoS (Qual...
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
IPPS
2007
IEEE
13 years 10 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
ISDA
2008
IEEE
13 years 11 months ago
2008
IEEE
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...