We have designed and realized cutting-edge metaheuristic local search techniques for solving complicated combinatorial optimization problems.

Some are embedded in Cooperative Group Optimization Systems, for solving Travelling Salesman Problem (TSP), Graph Coloring Problem (GCP), Quadratic Knapsack Problem (QKP), Flow-Shop Scheduling Problem (FSP), and Quadratic Assignment Problem (QAP), etc. Some are of stand-alone local search forms for solving the Magic Square Problem, finding narrow admissible k-tuples, and tacking Timetabling Problems, etc.