Show simple item record

hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorLaurent, Monique*
hal.structure.identifier
dc.contributor.authorSassano, Antonio*
dc.date.accessioned2014-12-18T08:47:57Z
dc.date.available2014-12-18T08:47:57Z
dc.date.issued1992
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/14477
dc.language.isoenen
dc.subjectinteger programmingen
dc.subject.ddc003en
dc.titleA characterization of knapsacks with the max-flow-—min-cut propertyen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenUsing a result of Seymour we give a characterization of a class of knapsack problems for which the clutter of minimal covers has the max-flow—min-cut property with respect to all right-hand sides. This implies that adding the minimal cover cuts to the problem is sufficient to guarantee an integer optimum for the linear programming relaxation. We also give a characterization of all the minimal cover cuts for this class of knapsacks.en
dc.relation.isversionofjnlnameOperations Research Letters
dc.relation.isversionofjnlvol11en
dc.relation.isversionofjnlissue2en
dc.relation.isversionofjnldate1992
dc.relation.isversionofjnlpages105-110en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/0167-6377(92)90041-Zen
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
hal.author.functionaut
hal.author.functionaut


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