Narrow search
Showing 1 - 7 of 7
Cover Image
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
San Segundo, Pablo; Furini, Fabio; León, Rafael - In: European journal of operational research : EJOR 299 (2022) 2, pp. 448-467
Persistent link: https://www.econbiz.de/10013207115
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
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
The maximum clique interdiction problem
Furini, Fabio; Ljubić, Ivana; Martin, Sébastien; San … - In: European journal of operational research : EJOR 277 (2019) 1, pp. 112-127
Persistent link: https://www.econbiz.de/10012014820
Cover Image
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Furini, Fabio; Ljubić, Ivana; Sinnl, Markus - In: European journal of operational research : EJOR 262 (2017) 2, pp. 438-448
Persistent link: https://www.econbiz.de/10011798731
Cover Image
Benders decomposition for very large scale partial set covering and maximal covering location problems
Cordeau, Jean-François; Furini, Fabio; Ljubić, Ivana - In: European journal of operational research : EJOR 275 (2019) 3, pp. 882-896
Persistent link: https://www.econbiz.de/10011993607
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