{"id":"https://openalex.org/W99814351","doi":"https://doi.org/10.1023/a:1021950608048","title":"Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem","display_name":"Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W99814351","doi":"https://doi.org/10.1023/a:1021950608048","mag":"99814351"},"language":"en","primary_location":{"id":"doi:10.1023/a:1021950608048","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1021950608048","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001025683","display_name":"Michel Vasquez","orcid":"https://orcid.org/0000-0001-6346-2550"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michel Vasquez","raw_affiliation_strings":["LGI2P-EMA, Parc Scientifique G. Besse, 30035, N\u00eemes Cedex 1, France","LGI2P-EMA, Parc Scientifique G. Besse, N\u00eemes Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LGI2P-EMA, Parc Scientifique G. Besse, 30035, N\u00eemes Cedex 1, France","institution_ids":[]},{"raw_affiliation_string":"LGI2P-EMA, Parc Scientifique G. Besse, N\u00eemes Cedex 1, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016332970","display_name":"Jin\u2010Kao Hao","orcid":"https://orcid.org/0000-0001-8813-4377"},"institutions":[{"id":"https://openalex.org/I49451733","display_name":"Universit\u00e9 d'Angers","ror":"https://ror.org/04yrqp957","country_code":"FR","type":"education","lineage":["https://openalex.org/I49451733"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jin-Kao Hao","raw_affiliation_strings":["LERIA Universit\u00e9 d'Angers, 2 bd Lavoisier, 49045, Angers Cedex 1, France","LERIA Universit\u00e9 d'Angers, Angers Cedex 1, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LERIA Universit\u00e9 d'Angers, 2 bd Lavoisier, 49045, Angers Cedex 1, France","institution_ids":["https://openalex.org/I49451733"]},{"raw_affiliation_string":"LERIA Universit\u00e9 d'Angers, Angers Cedex 1, France","institution_ids":["https://openalex.org/I49451733"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.9878,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.88785862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"1","first_page":"87","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12042","display_name":"Satellite Communication Systems","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6844246983528137},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6139442920684814},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5428978204727173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5406619310379028},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5278313755989075},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.47892507910728455},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47715848684310913},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4758027493953705},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4479161202907562},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.441222220659256},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.421043336391449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3934687674045563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3386495113372803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19918307662010193}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6844246983528137},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6139442920684814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5428978204727173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5406619310379028},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5278313755989075},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.47892507910728455},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47715848684310913},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4758027493953705},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4479161202907562},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.441222220659256},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.421043336391449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3934687674045563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3386495113372803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19918307662010193}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1023/a:1021950608048","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1021950608048","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00359381v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00359381","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 2003, 7 (1), pp.87-103. ⟨10.1023/A:1021950608048⟩","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:spr:jcomop:v:7:y:2003:i:1:d:10.1023_a:1021950608048","is_oa":false,"landing_page_url":"http://link.springer.com/10.1023/A:1021950608048","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W95643803","https://openalex.org/W254944847","https://openalex.org/W1492845317","https://openalex.org/W1555834419","https://openalex.org/W1786712251","https://openalex.org/W1998986673","https://openalex.org/W2011039300","https://openalex.org/W2046238609","https://openalex.org/W2062533874","https://openalex.org/W2066671865","https://openalex.org/W2123757087","https://openalex.org/W2138222131","https://openalex.org/W2145068995","https://openalex.org/W2170120409","https://openalex.org/W2314460664","https://openalex.org/W4285719527","https://openalex.org/W4298300677","https://openalex.org/W4312126896"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W623642078","https://openalex.org/W2040147369"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}