In this paper we deal with the critical node problem, where a given number of nodes has to be removed from an undirected graph in order to maximize the disconnections between the node pairs of the graph. We propose an integer linear programming model with a non-polynomial number of constraints but whose linear relaxation can be solved in polynomial time. We derive different valid inequalities and some theoretical results about them. We also propose an alternative model based on a quadratic reformulation of the problem. Finally, we perform many computational experiments and analyze the corresponding results.

Branch and cut algorithms for detecting critical nodes in undirected graphs

GROSSO, Andrea Cesare;
2012

Abstract

In this paper we deal with the critical node problem, where a given number of nodes has to be removed from an undirected graph in order to maximize the disconnections between the node pairs of the graph. We propose an integer linear programming model with a non-polynomial number of constraints but whose linear relaxation can be solved in polynomial time. We derive different valid inequalities and some theoretical results about them. We also propose an alternative model based on a quadratic reformulation of the problem. Finally, we perform many computational experiments and analyze the corresponding results.
53
3
649
680
Marco Di Summa; Andrea Grosso; Marco Locatelli
File in questo prodotto:
File Dimensione Formato  
CNP-bc_4aperto.pdf

Accesso aperto con embargo fino al 09/02/2013

Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 738.55 kB
Formato Adobe PDF
738.55 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2318/131733
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 74
  • ???jsp.display-item.citation.isi??? 64
social impact