{"id":"https://openalex.org/W2089131950","doi":"https://doi.org/10.1007/s10878-007-9074-4","title":"Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem","display_name":"Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem","publication_year":2007,"publication_date":"2007-04-20","ids":{"openalex":"https://openalex.org/W2089131950","doi":"https://doi.org/10.1007/s10878-007-9074-4","mag":"2089131950"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-007-9074-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-007-9074-4","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/A5112867244","display_name":"Yannick Vimont","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yannick Vimont","raw_affiliation_strings":["LGI2P, Parc Scientifique Georges Besse, 30035, Nimes, Cedex 1, France","Parc Scientifique Georges Besse"],"affiliations":[{"raw_affiliation_string":"LGI2P, Parc Scientifique Georges Besse, 30035, Nimes, Cedex 1, France","institution_ids":[]},{"raw_affiliation_string":"Parc Scientifique Georges Besse","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053938873","display_name":"Sylvain Boussier","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sylvain Boussier","raw_affiliation_strings":["LGI2P, Parc Scientifique Georges Besse, 30035, Nimes, Cedex 1, France","Parc Scientifique Georges Besse"],"affiliations":[{"raw_affiliation_string":"LGI2P, Parc Scientifique Georges Besse, 30035, Nimes, Cedex 1, France","institution_ids":[]},{"raw_affiliation_string":"Parc Scientifique Georges Besse","institution_ids":[]}]},{"author_position":"last","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, Parc Scientifique Georges Besse, 30035, Nimes, Cedex 1, France","Parc Scientifique Georges Besse"],"affiliations":[{"raw_affiliation_string":"LGI2P, Parc Scientifique Georges Besse, 30035, Nimes, Cedex 1, France","institution_ids":[]},{"raw_affiliation_string":"Parc Scientifique Georges Besse","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112867244"],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":9.3285,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.97499736,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"15","issue":"2","first_page":"165","last_page":"178"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9221302270889282},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.8462198972702026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6447805166244507},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6396092176437378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6306553483009338},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6106924414634705},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.5412028431892395},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5026817321777344},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48521092534065247},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.46927347779273987},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4219769835472107},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42070767283439636},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4200047552585602},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4136985242366791},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3323569595813751},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2874220013618469},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.23878169059753418},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23846983909606934},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22686493396759033}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9221302270889282},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8462198972702026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6447805166244507},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6396092176437378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6306553483009338},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6106924414634705},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.5412028431892395},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5026817321777344},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48521092534065247},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.46927347779273987},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4219769835472107},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42070767283439636},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4200047552585602},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4136985242366791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3323569595813751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2874220013618469},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.23878169059753418},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23846983909606934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22686493396759033},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-007-9074-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-007-9074-4","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-00353906v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00353906","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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, 2008, 15 (2), pp.165-178. ⟨10.1007/s10878-007-9074-4⟩","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:spr:jcomop:v:15:y:2008:i:2:d:10.1007_s10878-007-9074-4","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-007-9074-4","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":8,"referenced_works":["https://openalex.org/W1489512665","https://openalex.org/W1492845317","https://openalex.org/W1586409345","https://openalex.org/W1972300623","https://openalex.org/W2024256264","https://openalex.org/W2093436788","https://openalex.org/W2095018715","https://openalex.org/W2131608233"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2068707503","https://openalex.org/W1223758158","https://openalex.org/W2027111774","https://openalex.org/W2054195159","https://openalex.org/W1971493157","https://openalex.org/W2345471120","https://openalex.org/W2945820663"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2025-10-10T00:00:00"}