DEI/CISUC Seminars

Publication Date: 2018-11-06 10:00:40

November 07, Wednesday,
13h (sharp),
Room A.5.4. DEI-FCTUC

Invited Speaker: Vasco Manquinho

Title: " Constraint-based Multi-Objective Combinatorial Optimization"

Abstract: Multi-Objective Combinatorial Optimization (MOCO) arises when one needs to optimize conflicting objectives in a combinatorial problem.  In MOCO problems there are multiple optimal solutions, known as Pareto optimal solutions, each of them favoring certain objectives at the expense of others. Since finding the Pareto front (i.e. all Pareto optimal solutions) is very hard, algorithms are usually just able to approximate the Pareto front. In this talk we focus on using a new constraint-based method for finding the Pareto front. Experimental results show that our method is able to provide much better results than stochastic algorithms when solving the Virtual Machine Consolidation problem.

Short-bio: Associate Professor at the Department of Computer Science and Engineering, Instituto Superior Técnico, Univ. Lisboa. Senior Researcher at INESC-ID. His mais area of scientific activity has been in the development of algorithms for discrete optimization with focus on Boolean formulations.  Additionally, his tools have been applied in solving several problems in Bioinformatics, Software Management, Virtual Machine Consolidation, among other.