Show simple item record

Packing and covering with linear programming: A survey.

dc.contributor.authorRies, Bernard
dc.contributor.authorCornaz, Denis
dc.contributor.authorBentz, Cédric
HAL ID: 181270
dc.date.accessioned2013-03-11T14:55:53Z
dc.date.available2013-03-11T14:55:53Z
dc.date.issued2013
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/11129
dc.language.isoenen
dc.subjectHypergraphen
dc.subjectMin–max relationen
dc.subjectPolyhedraen
dc.subjectPackingen
dc.subjectCoveringen
dc.subjectLinear programmingen
dc.subject.ddc003en
dc.titlePacking and covering with linear programming: A survey.en
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenThis paper considers the polyhedral results and the min–max results on packing and covering problems of the decade. Since the strong perfect graph theorem (published in 2006), the main such results are available for the packing problem, however there are still important polyhedral questions that remain open. For the covering problem, the main questions are still open, although there has been important progress. We survey some of the main results with emphasis on those where linear programming and graph theory come together. They mainly concern the covering of cycles or dicycles in graphs or signed graphs, either with vertices or edges; this includes the multicut and integral multiflow problems. [Copyright &y& Elsevier]en
dc.relation.isversionofjnlnameEuropean Journal of Operational Research
dc.relation.isversionofjnlvol227en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2013
dc.relation.isversionofjnlpages409-422en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.ejor.2012.11.045en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen


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