Voir la notice de l'article provenant de la source Numdam
The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝒩𝒫-hard. This paper presents integer programming (ip) formulations for these three problems, that allowed us to solve them to optimality through ip branch-and-bound (b&b) or branch-and-cut (b&c) algorithms. Moreover, these models are the basis for the development of Lagrangian heuristics. Computational tests were conducted with instances taken from the literature where the performance of the Lagrangian heuristics were compared with that of the exact b&b and b&c algorithms. The results reveal that the Lagrangian heuristics yield solutions with minute, and often null, duality gaps for instances with several hundreds of points in small computation times. To our knowledge, this is the first computational study ever reported in which these three stabbing problems are considered and where provably optimal solutions are given.
Keywords: integer programming, lagrangian relaxation, stabbing problems, branch-and-bound, branch-and-cut
@article{RO_2014__48_2_211_0,
author = {Piva, Breno and de Souza, Cid C. and Frota, Yuri and Simonetti, Luidi},
title = {Integer programming approaches for minimum stabbing problems},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {211--233},
publisher = {EDP-Sciences},
volume = {48},
number = {2},
year = {2014},
doi = {10.1051/ro/2014008},
mrnumber = {3264376},
zbl = {1295.90021},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014008/}
}
TY - JOUR AU - Piva, Breno AU - de Souza, Cid C. AU - Frota, Yuri AU - Simonetti, Luidi TI - Integer programming approaches for minimum stabbing problems JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2014 SP - 211 EP - 233 VL - 48 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014008/ DO - 10.1051/ro/2014008 LA - en ID - RO_2014__48_2_211_0 ER -
%0 Journal Article %A Piva, Breno %A de Souza, Cid C. %A Frota, Yuri %A Simonetti, Luidi %T Integer programming approaches for minimum stabbing problems %J RAIRO - Operations Research - Recherche Opérationnelle %D 2014 %P 211-233 %V 48 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014008/ %R 10.1051/ro/2014008 %G en %F RO_2014__48_2_211_0
Piva, Breno; de Souza, Cid C.; Frota, Yuri; Simonetti, Luidi. Integer programming approaches for minimum stabbing problems. RAIRO - Operations Research - Recherche Opérationnelle, Tome 48 (2014) no. 2, pp. 211-233. doi: 10.1051/ro/2014008
Cité par Sources :