Show simple item record

dc.contributor.authorGabrel, Virginie
dc.date.accessioned2009-11-20T12:04:31Z
dc.date.available2009-11-20T12:04:31Z
dc.date.issued2006
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2483
dc.language.isoenen
dc.subjectStable set polytopeen
dc.subjectSatellite mission planningen
dc.subjectInteger programmingen
dc.subject.ddc003en
dc.titleStrengthened 0-1 linear formulation for the daily satellite mission planningen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explanation is based on stable set polytope formulations for perfect graphs.en
dc.relation.isversionofjnlnameJournal of Combinatorial Optimization
dc.relation.isversionofjnlvol11en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2006
dc.relation.isversionofjnlpages341-346en
dc.relation.isversionofdoihttp://dx.doi.org/10.1007/s10878-006-7912-4en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherSpringer Netherlandsen
dc.subject.ddclabelRecherche opérationnelleen


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