Show simple item record

dc.contributor.authorUchoa, Eduardo*
dc.contributor.authorMahjoub, Ali Ridha*
dc.contributor.authorBenhamiche, Amal*
dc.date.accessioned2013-07-15T12:51:08Z
dc.date.available2013-07-15T12:51:08Z
dc.date.issued2013
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/11557
dc.language.isoenen
dc.subjectBranch-and-Cuten
dc.subjectFacetsen
dc.subjectBin-Packingen
dc.subjectCapacitated Network Designen
dc.subject.ddc003en
dc.titleCapacitated Network Design using Bin-Packingen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversidade Federal Fluminense;Brésil
dc.description.abstractenIn 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.en
dc.relation.isversionofjnlnameElectronic Notes in Discrete Mathematics
dc.relation.isversionofjnlvol41en
dc.relation.isversionofjnldate2013
dc.relation.isversionofjnlpages479-486en
dc.relation.isversionofdoi10.1016/j.endm.2013.05.128en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
hal.person.labIds*
hal.person.labIds989*
hal.person.labIds*
hal.identifierhal-01497000*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record