Friday, 15:15 - 15:40 h, Room: H 2033


Joe Naoum-Sawaya
A Benders decomposition approach for the critical node selection problem

Coauthor: Christoph Buchheim


In this presentation, we discuss the critical node selection problem where given an undirected graph the objective is to remove a given number of nodes in order to minimize the pairwise connections. The critical node selection problem has several important applications arising in supply chain, telecommunication, and in healthcare. To solve large scale instances, we consider the integer programming formualtion and propose a Benders decomposition algorithm for its solution. The Benders decomposition approach is implemented in a branch-and-cut algorithm. We also discuss alternative quadratic reformulations and derive valid inequalities.


Talk 1 of the invited session Fri.3.H 2033
"Decomposition methods and applications" [...]
Cluster 11
"Integer & mixed-integer programming" [...]


  Payday Loans In North Carolina. Since its introduction in the market buying Cialis can be exclusively in pharmacy chains with a prescription from a doctor. I agree that this is very inconvenient and takes a lot of time and effort.