Méthodes de décomposition pour l'optimisation discrète

Nora Touati (1) , Lucas Létocart (1) , Anass Nagih (2)

1 LIPN - Laboratoire d'Informatique de Paris-Nord
2 LITA - Laboratoire d'Informatique Théorique et Appliquée

Many practical problems are modelled by integer programs. The difficulty of their resolution lies in the characterization of the feasible domain. Face to this difficulty, the researchers directed themselves towards approximations of this domain by decomposing the problem. The decomposition generally results in the relaxation of the integrality conditions on a subset of constraints. Decomposition methods differ from the bound quality and from the resolution methods used like their complexity. We present in this report some of these methods, analyze their strong and weak points and finally, establish a synthesis showing the relation between some methods considered to be different.

Mots clés: Integer Programming; decomposition methods

Domaines: Combinatoire [math.CO]

Nora Touati, Lucas Létocart, Anass Nagih. Méthodes de décomposition pour l'optimisation discrète. 2007. ⟨hal-00147704⟩