| Research interest |
Design and development of exact / heuristic algorithms for solving hard problems. Using exact techniques B&B, B&C to solve PLI problems. Development of metaheuristics techniques such as genetic algorithms, local search, tabù search. Use of exact and heuristic approaches to solve combinatorial optimization problems, usually defined on a graph: Traveling salesman problem (TSP), close enough traveling salesman problem, vehicle routing problems, arc routing problems, packing problems, flow problems, problems defined on labeled graphs, combinatorial problems defined on graphs. |
