Thumbnail - Request a copy

Capacitated Network Design using Bin-Packing

Uchoa, Eduardo; Mahjoub, Ali Ridha; Benhamiche, Amal (2013), Capacitated Network Design using Bin-Packing, Electronic Notes in Discrete Mathematics, 41, p. 479-486. 10.1016/j.endm.2013.05.128

Type
Article accepté pour publication ou publié
Date
2013
Journal name
Electronic Notes in Discrete Mathematics
Volume
41
Publisher
Elsevier
Pages
479-486
Publication identifier
Metadata
Show full item record
Author(s)
Uchoa, Eduardo

Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Benhamiche, Amal
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.
Subjects / Keywords
Branch-and-Cut; Facets; Bin-Packing; Capacitated Network Design