The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Abstract: In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, ...

Abstract: To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack ...

There are a few things that bring Lewis Hamilton & Max Verstappen together- one such being the wish of having a race in Africa. Many drivers have voiced the same opinion, as F1 touches down on every ...

The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...