Tutoriel : Variable neighbourhood and Formulation space searches: some recent advances
Nenad Mladenovic  1@  
1 : Université de Valenciennes
Université de Valenciennes et du Hainaut-Cambrésis

Variable neighbourhood search (VNS) and Formulation space search (FSS) are two general search strategies for solving optimization problems that follow the principle of change during the search for the better solution. In VNS, the neighbourhood structures are systematically changed, while in FSS the space of formulation is explored. In this talk I will present some recent results that follow rules of these two principles. Those reports include solving circle packing, maximum clique, mixed integer non-linear, planar p-median and min-max integer programs.


Online user: 2