| dc.contributor.author | Gabrel, Virginie | |
| dc.date.accessioned | 2009-11-20T12:04:31Z | |
| dc.date.available | 2009-11-20T12:04:31Z | |
| dc.date.issued | 2006 | |
| dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/2483 | |
| dc.language.iso | en | en |
| dc.subject | Stable set polytope | en |
| dc.subject | Satellite mission planning | en |
| dc.subject | Integer programming | en |
| dc.subject.ddc | 003 | en |
| dc.title | Strengthened 0-1 linear formulation for the daily satellite mission planning | en |
| dc.type | Article accepté pour publication ou publié | |
| dc.description.abstracten | In 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.isversionofjnlname | Journal of Combinatorial Optimization | |
| dc.relation.isversionofjnlvol | 11 | en |
| dc.relation.isversionofjnlissue | 3 | en |
| dc.relation.isversionofjnldate | 2006 | |
| dc.relation.isversionofjnlpages | 341-346 | en |
| dc.relation.isversionofdoi | http://dx.doi.org/10.1007/s10878-006-7912-4 | en |
| dc.description.sponsorshipprivate | oui | en |
| dc.relation.isversionofjnlpublisher | Springer Netherlands | en |
| dc.subject.ddclabel | Recherche opérationnelle | en |
