{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T05:37:45Z","timestamp":1774503465960,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,3,5]],"date-time":"2009-03-05T00:00:00Z","timestamp":1236211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10878-009-9215-z","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T07:22:38Z","timestamp":1236151358000},"page":"385-398","source":"Crossref","is-referenced-by-count":14,"title":["Strong formulation for the spot 5 daily photograph scheduling problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Glaydston Mattos","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Miguel Fragoso","family":"Constantino","sequence":"additional","affiliation":[]},{"given":"Luiz Antonio Nogueira","family":"Lorena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,5]]},"reference":[{"key":"9215_CR1","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur J Oper Res 121:40\u201345","journal-title":"Eur J Oper Res"},{"key":"9215_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01582278","volume":"43","author":"E Balas","year":"1989","unstructured":"Balas E, Ng SM (1989) On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Math Program 43:57\u201369","journal-title":"Math Program"},{"key":"9215_CR3","first-page":"235","volume":"2","author":"T Benoist","year":"2004","unstructured":"Benoist T, Rottembourg B (2004) Upper bounds for revenue maximization in a satellite scheduling problem. Q J Belg French Italian Oper Res Soc 2:235\u2013249","journal-title":"Q J Belg French Italian Oper Res Soc"},{"key":"9215_CR4","unstructured":"Bensana E, Verfaillie G, Agn\u00e8sse JC, Bataille N, Blumstein D (1996) Exact and approximate methods for the daily management of an earth observation satellite. In: Proceedings of the 4th international symposium on space mission operations and ground data systems (SpaceOps-96), Munich, Germany. Available at ftp:\/\/ftp.cert.fr\/pub\/verfaillie\/spaceops96.ps"},{"key":"9215_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E Bensana","year":"1999","unstructured":"Bensana E, Lama\u00edtre M, Verfaillie G (1999) Benchmark problems: earth observation satellite management. Constraints 4:293\u2013299","journal-title":"Constraints"},{"issue":"4","key":"9215_CR6","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.13.4.543","volume":"13","author":"M Conforti","year":"1988","unstructured":"Conforti M, Laurent M (1988) On the facial structure of independence system polyhedra. Math Oper Res 13(4):543\u2013555","journal-title":"Math Oper Res"},{"key":"9215_CR7","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1057\/palgrave.jors.2601926","volume":"56","author":"J-F Cordeau","year":"2005","unstructured":"Cordeau J-F, Laporte G (2005) Maximizing the value of an earth observation satellite orbit. J Oper Res Soc 56:962\u2013968","journal-title":"J Oper Res Soc"},{"issue":"3","key":"9215_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/moor.12.3.451","volume":"12","author":"R Euler","year":"1987","unstructured":"Euler R, Junger M, Reinelt G (1987) Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra. Math Oper Res 12(3):451\u2013462","journal-title":"Math Oper Res"},{"key":"9215_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10479-005-3448-8","volume":"139","author":"A Fr\u00e9ville","year":"2005","unstructured":"Fr\u00e9ville A, Hanafi S (2005) The multidimensional 0\u20131 knapsack problem\u2014bounds and computational aspects. Ann Oper Res 139:195\u2013227","journal-title":"Ann Oper Res"},{"key":"9215_CR10","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"DR Fulkerson","year":"1971","unstructured":"Fulkerson DR (1971) Blocking and anti-blocking pairs of polyhedra. Math Program 1:168\u2013194","journal-title":"Math Program"},{"key":"9215_CR11","unstructured":"Gabrel V (2005) An extensive comparison of 0\u20131 linear programs for SPOT5 daily mission planning problem. Ann LAMSADE 4\u20135"},{"key":"9215_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10878-006-7912-4","volume":"11","author":"V Gabrel","year":"2006","unstructured":"Gabrel V (2006) Strengthened 0\u20131 linear formulation for the daily satellite mission planning. J Comb Optim 11:341\u2013346","journal-title":"J Comb Optim"},{"key":"9215_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-1-4757-3752-3_7","volume-title":"Operations research in space and air","author":"V Gabrel","year":"2003","unstructured":"Gabrel V, Murat C (2003) Mathematical programming for earth observation satellite mission planning. In: Ciriani TA, Fasano G, Gliozzi S, Tadei R (eds) Operations research in space and air. Kluwer Academics, Dordrecht, pp 103\u2013122"},{"key":"9215_CR14","doi-asserted-by":"crossref","unstructured":"Habet D, Vasquez M (2004) Solving the selecting and scheduling satellite photographs problem with a consistent neighborhood heuristic. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence (ICTAI 2004), Boca Raton, USA, pp\u00a0302\u2013309","DOI":"10.1109\/ICTAI.2004.110"},{"key":"9215_CR15","unstructured":"ILOG (2006) CPLEX 10 reference manual. Gentilly, France"},{"key":"9215_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01589098","volume":"45","author":"M Laurent","year":"1989","unstructured":"Laurent M (1989) A generalization of antiwebs to independence systems and their canonical facets. Math Program 45:97\u2013108","journal-title":"Math Program"},{"key":"9215_CR17","unstructured":"Lemaitre M, Verfaillie G (1997) Daily management of an earth observation satellite: comparison of ILOG solver with dedicated algorithms for valued constraint satisfaction problems. In: Proceedings of the 3rd ILOG international users meeting, Paris, France. Available at ftp:\/\/ftp.cert.fr\/pub\/verfaillie\/ilog97.ps"},{"key":"9215_CR18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1109\/TSMCA.2005.843380","volume":"35","author":"W-C Lin","year":"2005","unstructured":"Lin W-C, Liao D-Y, Liu C-Y, Lee Y-Y (2005) Daily imaging scheduling of an earth observation satellite. IEEE Trans Syst Man Cyber Part A Syst Hum 35:213\u2013223","journal-title":"IEEE Trans Syst Man Cyber Part A Syst Hum"},{"key":"9215_CR19","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"key":"9215_CR20","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"43","author":"GL Nemhauser","year":"1992","unstructured":"Nemhauser GL, Sigismondi G (1992) A strong cutting plane\/branch-and-bound algorithm for node packing. J Oper Res Soc 43:443\u2013457","journal-title":"J Oper Res Soc"},{"key":"9215_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"GL Nemhauser","year":"1974","unstructured":"Nemhauser GL, Trotter LE (1974) Properties of vertex packing and independence system polyhedra. Math Program 6:48\u201361","journal-title":"Math Program"},{"key":"9215_CR22","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199\u2013215","journal-title":"Math Program"},{"key":"9215_CR23","unstructured":"Ribeiro GM (2007) Relaxa\u00e7\u00e3o lagrangeana com clusters para alguns problemas de otimiza\u00e7\u00e3o modelados em grafos de conflitos (Lagrangian relaxation with clusters for some optimization problems modeled by conflict graphs). PhD dissertation, National Institute for Space Research\u2014INPE, S\u00e3o Paulo, Brazil, p\u00a0194. Available at http:\/\/www.lac.inpe.br\/~lorena"},{"key":"9215_CR24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","volume":"44","author":"S Sassano","year":"1989","unstructured":"Sassano S (1989) On the facial structure of the set covering polytope. Math Program 44:181\u2013202","journal-title":"Math Program"},{"key":"9215_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M Vasquez","year":"2001","unstructured":"Vasquez M, Hao J-K (2001) A \u201clogic-constrained\u201d knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. J Comput Optim Appl 20:137\u2013157","journal-title":"J Comput Optim Appl"},{"key":"9215_CR26","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1021950608048","volume":"7","author":"M Vasquez","year":"2003","unstructured":"Vasquez M, Hao J-K (2003) Upper bounds for the SPOT 5 daily photograph scheduling problem. J Comb Optim 7:87\u2013103","journal-title":"J Comb Optim"},{"key":"9215_CR27","unstructured":"Verfaillie G, Lema\u00eetre M, Schiex T (1996) Russian doll search for solving constraint optimization problems. In: Proceedings of the 13th national conference on artificial intelligence (AAAI-96), Portland, USA, pp\u00a0181\u2013187"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9215-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9215-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9215-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:13Z","timestamp":1559276293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9215-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,5]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9215"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9215-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,5]]}}}