167 search results - page 1 / 34 » Scalable parallel algorithms for difficult combinatorial pro... |
PDCN
2004
13 years 6 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
GECCO
2009
Springer
13 years 8 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
ALGORITHMICA
2006
13 years 5 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
AAAI
2000
13 years 6 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...