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

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

Year of publication:	2021
Authors:	Furini, Fabio ; Ljubić, Ivana ; San Segundo, Pablo ; Zhao, Yanlu
Published in:	European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 294.2021, 1 (1.10.), p. 54-69
Subject:	Combinatorial optimization \| Interdiction problems \| Maximum clique \| Most vital edges \| Algorithmus \| Algorithm \| Mathematische Optimierung \| Mathematical programming \| Ganzzahlige Optimierung \| Integer programming \| Theorie \| Theory \| Scheduling-Verfahren \| Scheduling problem

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

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

A service of the