Narrow search
Showing 1 - 7 of 7
Cover Image
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; … - In: European journal of operational research : EJOR 278 (2019) 1, pp. 76-90
Persistent link: https://www.econbiz.de/10012102594
Cover Image
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo - In: European journal of operational research : EJOR 289 (2021) 2, pp. 435-455
Persistent link: https://www.econbiz.de/10012416751
Cover Image
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo; Furini, Fabio; Álvarez, David; … - In: European journal of operational research : EJOR 307 (2023) 3, pp. 1008-1025
Persistent link: https://www.econbiz.de/10014282934
Cover Image
An exact bit-parallel algorithm for the maximum clique problem
San Segundo, Pablo; Rodríguez-Losada, Diego; Jiménez, … - In: Computers & operations research : and their … 38 (2011) 2, pp. 571-581
Persistent link: https://www.econbiz.de/10008669900
Cover Image
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo; Lopez, Alvaro; Pardalos, Panos M. - In: Computers & operations research : and their … 66 (2016), pp. 81-94
Persistent link: https://www.econbiz.de/10011428989
Cover Image
Exact approaches for the knapsack problem with setups
Furini, Fabio; Monaci, Michele; Traversi, Emiliano - In: Computers & operations research : and their … 90 (2018), pp. 208-220
Persistent link: https://www.econbiz.de/10011775328
Cover Image
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio; Iori, Manuel; Martello, Silvano; … - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 392-405
Persistent link: https://www.econbiz.de/10011291290