{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T13:05:26Z","timestamp":1759496726377,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_55","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"670-684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Verfaillie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Lema\u00eetre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"55_CR1","unstructured":"E. Aarts and J. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997."},{"key":"55_CR2","unstructured":"R. Bellman. Dynamic Programming. Princeton University Press, 1957."},{"issue":"3","key":"55_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E. Bensana","year":"1999","unstructured":"E. Bensana, M. Lema\u00eetre, and G. Verfaillie. Earth Observation Satellite Management. Constraints: An International Journal, 4(3): 293\u2013299, 1999.","journal-title":"Constraints: An International Journal"},{"key":"55_CR4","unstructured":"E. Bensana, G. Verfaillie, J.C. Agn\u00e9se, N. Bataille, and D. Blumstein. Exact and Approximate Methods for the Daily Management of an Earth Observation Satellite. In Proc. of SpaceOps-96, M\u00fcnich, Germany, 1996."},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"R. Dechter. Bucket Elimination:a Unifying Framework for Reasoning. artificial Intelligence, 113:41\u201385, 1999.","journal-title":"artificial Intelligence"},{"key":"55_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York, 1979."},{"key":"55_CR7","unstructured":"W. Harvey and M. Ginsberg. Limited Discrepancy Search. In Proc. of IJCAI-95, pages 607\u2013613, Montr\u00e9al, Canada, 1995."},{"key":"55_CR8","unstructured":"P. Van Hentenryck. The OPL Optimization Programming Language. MIT Press, 1999."},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"J. Larrosa. Boosting Search with Variable Elimination. In Proc. of CP-00, Singapore, 2000.","DOI":"10.1007\/3-540-45349-0_22"},{"key":"55_CR10","doi-asserted-by":"crossref","unstructured":"E. Lawler, J. Lenstra, A. Rinnooy Kan, and D. Shmoys, editors. The Traveling Salesman Problem: A Guided Tour ofCombinatorial Optimization. John Wiley & Sons, 1985.","DOI":"10.2307\/2582681"},{"key":"55_CR11","unstructured":"L. Lobjois, M. Lema\u00edtre, and G. Verfaillie. Large Neighbourhood Search using Constraint Propagation and Greedy Reconstruction for Valued CSP Resolution. In Proc. of the ECAI-00 Workshop on \u201cModelling and Solving with Constraints\u201c, Berlin, Germany, 2000."},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"T. Schiex. arc Consistency for Soft Constraints. In Proc. of CP-00, Singapore, 2000.","DOI":"10.1007\/3-540-45349-0_30"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"P. Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In Proc. of CP-98, pages 417\u2013431, Pisa, Italia, 1998.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"55_CR14","unstructured":"M. Vasquez and J.K. Hao. A Logic-constrained Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. To appear in the Journal of Computational Optimization and Applications, 2001."},{"key":"55_CR15","unstructured":"G. Verfaillie, E. Bensana, C. Michelon-Edery, and N. Bataille. Dealing with Uncertainty when Managing an Earth Observation Satellite. In Proc. of i-SAIRAS-99, pages 205\u2013207, Noordwijk, The Netherlands, 1999."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T01:35:22Z","timestamp":1683855322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}