The development of efficient exact algorithms for Multi-Objective Combinatorial Optimization (MOCO) problems is a central research topic in operations research. Major advances have been recorded these last 10 years. One example is the two phase method which is now able to deal with situations presenting more than two objectives. Another example is the definition of the multi-objective branch and bound principle and its successful applications on several optimization problems. Nevertheless, real-life applications complexify the picture. Large scale multiple objective combinatorial optimization problems, and/or formulation combining continuous and discrete variables have to be considered.
This talk introduces some recent advances and open questions in that field, and develops an example of recent exact algorithms proposed.