{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:09:51Z","timestamp":1777565391567,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T00:00:00Z","timestamp":1226707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10589-008-9220-7","type":"journal-article","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T16:56:18Z","timestamp":1226681778000},"page":"307-333","source":"Crossref","is-referenced-by-count":109,"title":["Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite"],"prefix":"10.1007","volume":"47","author":[{"given":"Djamal","family":"Habet","sequence":"first","affiliation":[]},{"given":"Michel","family":"Vasquez","sequence":"additional","affiliation":[]},{"given":"Yannick","family":"Vimont","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,15]]},"reference":[{"issue":"3","key":"9220_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10288-004-0044-8","volume":"2","author":"T. Benoist","year":"2004","unstructured":"Benoist, T., Rottembourg, B.: Upper bounds of the maximal revenue of an Earth observation satellite. 4OR: Q.\u00a0J. Oper. Res. 2(3), 235 (2004)","journal-title":"4OR: Q.\u00a0J. Oper. Res."},{"key":"9220_CR2","unstructured":"Bensana, E., Agn\u00e8se, G.V.J., Bataille, N., Blumstein, D.: Exact and approximate methods for the daily management of an Earth observation satellite. In: Proceeding of the 4th International Symposium od Space Mission Operations and Ground Data Systems (spaceOps\u201396) (1996)"},{"issue":"3","key":"9220_CR3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E. Bensana","year":"1999","unstructured":"Bensana, E., Lema\u00eetre, M., Verfaillie, G.: Earth observation satellite management. Constraints: Int. J. 4(3), 293\u2013299 (1999)","journal-title":"Constraints: Int. J."},{"key":"9220_CR4","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"59","author":"J. Cordeau","year":"2001","unstructured":"Cordeau, J., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J.\u00a0Oper. Res. Soc. 59, 928\u2013936 (2001)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9220_CR5","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time window. Oper. Res. 40, 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"9220_CR6","first-page":"191","volume":"26","author":"M. Desrochers","year":"1988","unstructured":"Desrochers, M., Soumis, F.: A generalized permanent labelling algorithm or the shortest path problem with time windows. INFOR 26, 191\u2013212 (1988)","journal-title":"INFOR"},{"key":"9220_CR7","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63, 437\u2013461 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9220_CR8","unstructured":"Gabrel, V.: Improved linear programming bounds via column generation for daily scheduling of Earth observation satellite. Technical report, LIPN (1999)"},{"key":"9220_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1018920709696","volume":"69","author":"V. Gabrel","year":"1997","unstructured":"Gabrel, V., Moulet, A., Murat, C., Paschos, V.T.: A new model and derived algorithms for the satellite shot planning problem using graph theory concepts. Ann. Oper. Res. 69, 115\u2013134 (1997)","journal-title":"Ann. Oper. Res."},{"key":"9220_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Amsterdam (1997)"},{"key":"9220_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(94)90385-9","volume":"78","author":"N. Hall","year":"1994","unstructured":"Hall, N., Magazine, M.: Maximizing the value of a space mission. Eur. J. Oper. Res. 78, 224\u2013241 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9220_CR12","unstructured":"Harrison, S.A., Price, M.E.: Task scheduling for satellite based imagery. In Proceedings of the 18th Workshop of UK Planning and Scheduling Special Interest Group, pp.\u00a064\u201378 (1999)"},{"issue":"2\u20133","key":"9220_CR13","first-page":"93","volume":"17","author":"D. Houck","year":"1980","unstructured":"Houck, D., Picard, J., Queyranne, M., Vemuganti, R.: The travelling salesman problem as a constrained shortest path problem: theory and computational experience. Oper. Res. 17(2\u20133), 93\u2013109 (1980)","journal-title":"Oper. Res."},{"key":"9220_CR14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","volume":"45","author":"N. Kohl","year":"1997","unstructured":"Kohl, N., Madsen, O.B.G.: An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation. Oper. Res. 45, 395\u2013406 (1997)","journal-title":"Oper. Res."},{"issue":"5","key":"9220_CR15","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S1270-9638(02)01173-2","volume":"6","author":"M. Lema\u00eetre","year":"2002","unstructured":"Lema\u00eetre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.M., Bataille, N.: Selecting and scheduling observations of agile satellites. Aerosp. Sci. Technol. 6(5), 367\u2013381 (2002)","journal-title":"Aerosp. Sci. Technol."},{"key":"9220_CR16","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Comput. J. 44, 2245\u20132269 (1965)","journal-title":"Bell Syst. Comput. J."},{"key":"9220_CR17","unstructured":"ROADEF\u20192003 Challenge: Booklet of Abstracts. ROADEF society, France (2003)"},{"key":"9220_CR18","unstructured":"Schiex, T., Fargier, F., Verfaillie, G.: Valued constrained satisfaction problems: hard and easy problems. In Proceedings of IJCAI\u201995, 14th International Joint Conference on Artificial Intelligence pp.\u00a0631\u2013639 (1995)"},{"key":"9220_CR19","unstructured":"Vasquez, M., Habet, D., Dupont, A.: Neighborhood design by consistency checking. In the Proceedings of the First International Workshop on Heuristics (IWH\u201902), vol.\u00a04, pp.\u00a019\u201327 (2002)"},{"issue":"2","key":"9220_CR20","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.: A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an Earth observation satellite. J.\u00a0Comput. Optim. Appl. 20(2), 137\u2013157 (2001)","journal-title":"J.\u00a0Comput. Optim. Appl."},{"key":"9220_CR21","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.: Upper bounds for the SPOT5 daily photograph scheduling problem. J.\u00a0Comb. Optim. 7, 87\u2013103 (2003)","journal-title":"J.\u00a0Comb. Optim."},{"issue":"1","key":"9220_CR22","first-page":"146","volume":"46","author":"W. Wolf","year":"2000","unstructured":"Wolf, W., Sorensen, S.: Three scheduling algorithms applied to the Earth observing systems domain. Manag. Sci. 46(1), 146\u2013168 (2000)","journal-title":"Manag. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9220-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9220-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9220-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:35Z","timestamp":1559302595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9220-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,15]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9220"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9220-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,15]]}}}