{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:04:50Z","timestamp":1777597490533,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1021950608048","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:29Z","timestamp":1048290989000},"page":"87-103","source":"Crossref","is-referenced-by-count":63,"title":["Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Michel","family":"Vasquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"5113644_CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/12.762522","volume":"48","author":"R. Battiti","year":"1999","unstructured":"R. Battiti and A.A. Bertossi, \u201cGreedy, prohibition, and reactive heuristics for graph partitioning,\u201d IEEE Transactions on Computers, vol. 48, no. 4, pp. 361-385, 1999.","journal-title":"IEEE Transactions on Computers"},{"key":"5113644_CR2","doi-asserted-by":"crossref","unstructured":"R. Bellman and D. Stuart, Applied Dynamic Programming, Princeton University Press, 1962.","DOI":"10.1515\/9781400874651"},{"issue":"3","key":"5113644_CR3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E. Bensana","year":"1999","unstructured":"E. Bensana, M. Lema\u00eetre, and G. Verfaillie, \u201cEarth observation satellite management,\u201d Constraints, vol. 4, no. 3, pp. 293-299, 1999.","journal-title":"Constraints"},{"key":"5113644_CR4","unstructured":"E. Bensana, G. Verfaillie, J.C. Agnse, N. Bataille, and D. Blumstein, \u201cExact and inexact methods for the daily management of an earth observation satellite,\u201d in Proc. 4th Intl. Symposium on Space Mission Operations and Ground Data Systems, M\u00fcnich, Germany, 1996."},{"key":"5113644_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D. Fayard","year":"1982","unstructured":"D. Fayard and G. Plateau, \u201cAn algorithm for the solution of the 0-1 knapsack problem,\u201d Computing, vol. 28, pp. 269-287, 1982.","journal-title":"Computing"},{"key":"5113644_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C. Friden","year":"1989","unstructured":"C. Friden, A. Hertz, and D. de Werra, \u201cStabulus: A technique for finding stable sets in large graphs with tabu search,\u201d Computing, vol. 42, pp. 35-44, 1989.","journal-title":"Computing"},{"key":"5113644_CR7","unstructured":"V. Gabrel, \u201cImproved linear programming bounds via column generation procedure for the daily scheduling of earth observation satellite,\u201d Research Report 99-01, IPN, Paris XIII University, Jan. 1999."},{"key":"5113644_CR8","unstructured":"M. Garey and D. Johnson, Computers & Intractability: A Guide to the Theory of NP-Completeness,W.H. Freeman and Company, 1979."},{"key":"5113644_CR9","unstructured":"M. Gondran and M. Minoux, Graphes & Algorithmes, Eyrolles, 1985."},{"key":"5113644_CR10","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, JohnWiley: New York, 1990."},{"key":"5113644_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"R.M. Nauss","year":"1976","unstructured":"R.M. Nauss, \u201cAn efficient algorithm for 0-1 knapsack problem,\u201d Management Science, vol. 23, ppp.27-31, 1976.","journal-title":"Management Science"},{"key":"5113644_CR12","volume-title":"Numerical Recipes in C","author":"W.H. Press","year":"1992","unstructured":"W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C, Cambridge University Press: Cambridge, 1992."},{"key":"5113644_CR13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02125455","volume":"63","author":"E. Rolland","year":"1996","unstructured":"E. Rolland, H.P. Pirkul, and F. Glover, \u201cTabu search for graph partitioning,\u201d Annals of Operations Research, vol. 63, pp. 209-232, 1996.","journal-title":"Annals of Operations Research"},{"key":"5113644_CR14","unstructured":"D.K. Smith, Dynamic Programming: A Practical Introduction, Ellis Horwood, 1990."},{"key":"5113644_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M. Vasquez","year":"2001","unstructured":"M. Vasquez and J.K. Hao, \u201cA logic-constrained\u201d knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite,\u201d Journal of Computational Optimization and Applications, vol. 20, pp. 137-157, 2001.","journal-title":"Journal of Computational Optimization and Applications"},{"key":"5113644_CR16","unstructured":"G. Verfaillie, M. Lema\u00eetre, and T. Schiex, \u201cRussian doll search for solving constraint optimization problems,\u201d in Proc. 13th National Conference on Artificial Intelligence, Portland, USA, 1996, pp. 182-187."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021950608048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021950608048\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021950608048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:11:17Z","timestamp":1751281877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021950608048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5113644"],"URL":"https:\/\/doi.org\/10.1023\/a:1021950608048","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}