2340 search results - page 48 / 468 » Copying and Comparing: Problems and Solutions |
HEURISTICS
2006
14 years 11 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
SAC
1996
ACM
15 years 4 months ago
1996
ACM
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
HEURISTICS
2007
14 years 11 months ago
2007
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
100
click to vote
EVOW
2000
Springer
15 years 3 months ago
2000
Springer
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
123
click to vote
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
14 years 3 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...