Narrow search
Showing 1 - 7 of 7
Cover Image
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
Gendron, Bernard; Lucena, Abílio; Cunha, Alexandre … - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 645-657
Persistent link: https://www.econbiz.de/10010477294
Cover Image
Spanning trees with a constraint on the number of leaves. A new formulation
Gouveia, Luis; Simonetti, Luidi - In: Computers & operations research : and their … 81 (2017), pp. 257-268
Persistent link: https://www.econbiz.de/10011656244
Cover Image
Reformulations and solution algorithms for the maximum leaf spanning tree problem
Lucena, Abílio; Maculan F., Nelson; Simonetti, Luidi - In: Computational Management Science : CMS 7 (2010) 3, pp. 289-311
Persistent link: https://www.econbiz.de/10003977686
Cover Image
A new formulation for the Safe Set problem on graphs
Macambira, Ana Flavia Uzeda; Simonetti, Luidi; … - In: Computers & operations research : and their … 111 (2019), pp. 346-356
Persistent link: https://www.econbiz.de/10012098191
Cover Image
A decomposition approach for the p-median problem on disconnected graphs
Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina - In: Computers & operations research : and their … 86 (2017), pp. 79-85
Persistent link: https://www.econbiz.de/10011732213
Cover Image
Feasibility check for the distance geometry problem : an application to molecular conformations
Agra, Agostinho; Figueiredo, Rosa; Lavor, Carlile; … - In: International transactions in operational research : … 24 (2017) 5, pp. 1023-1040
Persistent link: https://www.econbiz.de/10011796461
Cover Image
The minimum cost network upgrade problem with maximum robustness to multiple node failures
Barbosa, Fábio; Agra, Agostinho; Sousa, Amaro de - In: Computers & operations research : and their … 136 (2021), pp. 1-16
Persistent link: https://www.econbiz.de/10012629576