A branch-and-cut algorithm for the Edge Interdiction Clique Problem-Reference-Cited by-同舟云学术

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

Published:2021-10 Issue:1 Volume:294 Page:54-69
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Furini Fabio^ORCID,Ljubić Ivana,San Segundo Pablo,Zhao Yanlu

Funder

Ministerio de Ciencia, Innovación y Universidades

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference40 articles.

1. The generalized reserve set covering problem with connectivity and buffer requirements;Álvarez-Miranda;European Journal of Operational Research,2021

2. Surf: Speeded up robust features;Bay,2006

3. Emergent clique formation in terrorist recruitment;Berry,2004

4. Crime data mining: A general framework and some examples;Chen;Computer,2004

5. A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts;Coniglio;European Journal of Operational Research,2021

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On supervalid inequalities for binary interdiction games;Mathematical Programming;2024-07-27

2. Benders decomposition algorithms for minimizing the spread of harmful contagions in networks;Computers & Operations Research;2024-07

3. Mathematical programming formulations for the Collapsed k-Core Problem;European Journal of Operational Research;2023-11

4. Capacitated multiple allocation hub location problems under the risk of interdiction: model formulations and solution approaches;Annals of Operations Research;2023-08-31

5. Exact methods for discrete $${\varGamma }$$-robust interdiction problems with an application to the bilevel knapsack problem;Mathematical Programming Computation;2023-07-10