Capacitated Network Design using Bin-Packing

Eduardo Uchoa , Ali Ridha Mahjoub (1) , Amal Benhamiche

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

In this paper, we consider the Capacitated Network Design (CND) problem. We investigate the relationship between CND and the Bin-Packing problem. This is exploited for identifying new classes of valid inequalities for the CND problem and developing a branch-and-cut algorithm to solve it efficiently.

Mots clés: Branch-and-Cut; Facets; Bin-Packing; Capacitated Network Design

Domaines: Informatique [cs]

Eduardo Uchoa, Ali Ridha Mahjoub, Amal Benhamiche. Capacitated Network Design using Bin-Packing. Electronic Notes in Discrete Mathematics, 2013, 41, ⟨10.1016/j.endm.2013.05.128⟩. ⟨hal-01497000⟩