First we propose a mixed integer linear programming formulation with network survivability constraints. Then we study a sub-problem, the grooming problem.
Dans un premier temps nous modélisons un problème prenant en compte la tolérance aux pannes, puis nous en étudions un sous-problème, le groupage.
Second, we show how to solve the problem to optimality using a mixed integer linear programming formulation (MILP).
Examples are used only to help you translate the word or expression searched in various contexts. They are not selected or validated by us and can contain inappropriate terms or ideas. Please report examples to be edited or not to be displayed. Potentially sensitive, inappropriate or colloquial translations are usually marked in red or in orange.