Title of article :
Capacitated Network Design using Bin-Packing
Author/Authors :
Benhamiche، نويسنده , , Amal and Ridha Mahjoub، نويسنده , , A. and Perrot، نويسنده , , Nancy and Uchoa، نويسنده , , Eduardo، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2013
Abstract :
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.
Keywords :
Facets , Capacitated Network Design , Bin-Packing , Branch-and-cut
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
