Capacitated Network Design using Bin-Packing

Thumbnail
Date
2013
Dewey
Recherche opérationnelle
Sujet
Branch-and-Cut; Facets; Bin-Packing; Capacitated Network Design
Journal issue
Electronic Notes in Discrete Mathematics
Volume
41
Publication date
2013
Article pages
479-486
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.endm.2013.05.128
URI
https://basepub.dauphine.fr/handle/123456789/11557
Collections
Metadata
Show full item record
Author
Uchoa, Eduardo
Mahjoub, Ali Ridha
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Benhamiche, Amal
Type
Article accepté pour publication ou publié
Abstract (EN)
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.