A Compact Mixed Integer Linear Formulation for Safe Set Problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Letters Année : 2020

A Compact Mixed Integer Linear Formulation for Safe Set Problems

Résumé

The Safe Set Problem is a type of partitioning problem with particular constraints on the weight of adjacent partition components. Several theoretical results exist in the literature along with a mixed integer linear formulation. We propose a new, more compact, Mixed Integer Linear Program for the (Weighted) Safe Set Problem and Connected Safe Set Problem with a polynomial number of variables and constraints, based on a flow from an additional fictitious node. The model is enriched by symmetry-breaking considerations and a variable reduction subproblem. We test the model on a benchmark of small instances which underline the difficulty of solving the Safe Set Problem through mathematical programming approaches. We also compare it with the only existing formulation in the literature and find that our approach is usually more efficient on a set of benchmark instances.
Fichier principal
Vignette du fichier
doc00031321.pdf (284.31 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02476289 , version 1 (17-02-2020)

Identifiants

Citer

Pierre Hosteins. A Compact Mixed Integer Linear Formulation for Safe Set Problems. Optimization Letters, 2020, 21p. ⟨10.1007/s11590-020-01540-z⟩. ⟨hal-02476289⟩
51 Consultations
166 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More