Similar Search Results

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

Integer programming approaches for minimum stabbing problems

Piva, Breno; Souza, Cid Carvalho de; Frota, Yuri; … - In: RAIRO / Operations research 48 (2014) 2, pp. 211-233

Persistent link: https://www.econbiz.de/10010530205

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem

Cunha, Alexandre Salles da; Simonetti, Luidi; Lucena, … - In: European journal of operational research : EJOR 246 (2015) 2, pp. 392-399

Persistent link: https://www.econbiz.de/10011338141

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow

González, Pedro Henrique; Simonetti, Luidi; Michelon, … - In: Computers & operations research : and their … 76 (2016), pp. 134-146

Persistent link: https://www.econbiz.de/10011582676

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

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

Exact solution algorithms for the chordless cycle problem

Pereira, Dilson Lucas; Lucena, Abílio; Cunha, … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 4, pp. 1970-1986

Persistent link: https://www.econbiz.de/10013362523

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

A new Branch and Bound method for a discrete truss topology design problem

Cerveira, Adelaide; Agra, Agostinho; Bastos, Fernando; … - In: Computational Optimization and Applications 54 (2013) 1, pp. 163-187

Our paper considers a classic problem in the field of Truss Topology Design, the goal of which is to determine the stiffest truss, under a given load, with a bound on the total volume and discrete requirements in the cross-sectional areas of the bars. To solve this problem we propose a new...

Persistent link: https://www.econbiz.de/10010896575

Using decomposition to improve greedy solutions of the optimal diversity management problem

Agra, Agostinho; Cerdeira, Jorge Orestes; Requejo, Cristina - In: International transactions in operational research : … 20 (2013) 5, pp. 617-625

Persistent link: https://www.econbiz.de/10010158611