Similar Search Results

Efficiently enumerating all maximal cliques with bit-parallelism

San Segundo, Pablo; Artieda, Jorge; Strash, Darren - In: Computers & operations research : and their … 92 (2018), pp. 37-46

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

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

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

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

A branch-and-cut algorithm for the Edge Interdiction Clique Problem

Furini, Fabio; Ljubić, Ivana; San Segundo, Pablo; … - In: European journal of operational research : EJOR 294 (2021) 1, pp. 54-69

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

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

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

Infra-chromatic bound for exact maximum clique search

San Segundo, Pablo; Nikolaev, Alexey; Batsyn, Mikhail - In: Computers & operations research : and their … 64 (2015), pp. 293-303

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

Research trends in combinatorial optimization

Weinand, Jann Michael; Sörensen, Kenneth; San Segundo, … - In: International transactions in operational research : a … 29 (2022) 2, pp. 667-705

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

Integer Linear Programming Formulations for the Maximum Flow Blocker Problem

Bentoumi, Isma; Furini, Fabio; Mahjoub, Ali Ridha; … - 2023

Given a directed graph with capacities and blocker costs associated with its arcs, we study the maximum flow blocker problem (MFBP) which asks to find a minimum-cost subset of arcs to be removed from the graph in such a way that the remaining maximum-flow value does not exceed a given threshold....

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