{"id":"https://openalex.org/W1989975316","doi":"https://doi.org/10.1145/1244002.1244079","title":"Using constraint techniques for a safe and fast implementation of optimality-based reduction","display_name":"Using constraint techniques for a safe and fast implementation of optimality-based reduction","publication_year":2007,"publication_date":"2007-03-11","ids":{"openalex":"https://openalex.org/W1989975316","doi":"https://doi.org/10.1145/1244002.1244079","mag":"1989975316"},"language":"en","primary_location":{"id":"doi:10.1145/1244002.1244079","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1244002.1244079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 ACM symposium on Applied computing","raw_type":"proceedings-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/A5009638239","display_name":"Yahia Lebbah","orcid":"https://orcid.org/0000-0003-4736-2976"},"institutions":[{"id":"https://openalex.org/I137407579","display_name":"Universit\u00e9 Oran 1 Ahmed Ben Bella","ror":"https://ror.org/059et2b68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I137407579"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Yahia Lebbah","raw_affiliation_strings":["Universit\u00e9 d'Oran Es-Senia, Oran, Algeria","[Universite d'Oran Es Senia, Oran, Algeria]"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 d'Oran Es-Senia, Oran, Algeria","institution_ids":["https://openalex.org/I137407579"]},{"raw_affiliation_string":"[Universite d'Oran Es Senia, Oran, Algeria]","institution_ids":["https://openalex.org/I137407579"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111564368","display_name":"Claude Michel","orcid":"https://orcid.org/0000-0001-8552-1881"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Claude Michel","raw_affiliation_strings":["UNSA-CNRS, Sophia Antipolis -- Cedex France"],"affiliations":[{"raw_affiliation_string":"UNSA-CNRS, Sophia Antipolis -- Cedex France","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111943507","display_name":"Michel Rueher","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michel Rueher","raw_affiliation_strings":["UNSA-CNRS, Sophia Antipolis -- Cedex France"],"affiliations":[{"raw_affiliation_string":"UNSA-CNRS, Sophia Antipolis -- Cedex France","institution_ids":["https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009638239"],"corresponding_institution_ids":["https://openalex.org/I137407579"],"apc_list":null,"apc_paid":null,"fwci":0.3209,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62956988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"326","last_page":"331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.977400004863739,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/reduction","display_name":"Reduction (mathematics)","score":0.8528062105178833},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6922687292098999},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6663195490837097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6599434018135071},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5778992772102356},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5344893932342529},{"id":"https://openalex.org/keywords/reduction-strategy","display_name":"Reduction strategy","score":0.4475270211696625},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4299708604812622},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41262978315353394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.320480614900589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22205516695976257},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.09050846099853516}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.8528062105178833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6922687292098999},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6663195490837097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6599434018135071},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5778992772102356},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5344893932342529},{"id":"https://openalex.org/C56858530","wikidata":"https://www.wikidata.org/wiki/Q15947151","display_name":"Reduction strategy","level":2,"score":0.4475270211696625},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4299708604812622},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41262978315353394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.320480614900589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22205516695976257},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.09050846099853516},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1244002.1244079","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1244002.1244079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 ACM symposium on Applied computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W9443576","https://openalex.org/W258481170","https://openalex.org/W353591846","https://openalex.org/W1548650523","https://openalex.org/W1563516866","https://openalex.org/W1595068075","https://openalex.org/W1603446717","https://openalex.org/W1966164803","https://openalex.org/W1988446106","https://openalex.org/W1990426442","https://openalex.org/W2022484305","https://openalex.org/W2023059010","https://openalex.org/W2049953405","https://openalex.org/W2056115003","https://openalex.org/W2067456686","https://openalex.org/W2067648572","https://openalex.org/W2079809152","https://openalex.org/W2081148668","https://openalex.org/W2099299739","https://openalex.org/W2133520239","https://openalex.org/W2135432705","https://openalex.org/W2154904851","https://openalex.org/W2221469269","https://openalex.org/W2294646659","https://openalex.org/W2787523326","https://openalex.org/W2802959418","https://openalex.org/W3146520007","https://openalex.org/W3195153441","https://openalex.org/W4239256746","https://openalex.org/W4403630709","https://openalex.org/W6680064427","https://openalex.org/W6750222127","https://openalex.org/W7047728865","https://openalex.org/W7058398353"],"related_works":["https://openalex.org/W4291309325","https://openalex.org/W129486638","https://openalex.org/W2950474130","https://openalex.org/W2924604769","https://openalex.org/W2737452945","https://openalex.org/W4313469555","https://openalex.org/W1547011777","https://openalex.org/W2263461846","https://openalex.org/W1514706798","https://openalex.org/W1985899403"],"abstract_inverted_index":{"Optimality-based":[0],"reduction":[1,93],"attempts":[2],"to":[3,14,23,90],"take":[4],"advantage":[5],"of":[6,10,18,28,63],"the":[7,11,16,19,26,33,40,52],"known":[8],"bounds":[9],"objective":[12],"function":[13],"reduce":[15],"domain":[17],"variables,":[20],"and":[21,38,48,73,97],"thus":[22],"speed":[24],"up":[25],"search":[27],"a":[29,60,95],"global":[30,54],"optimum.":[31,55],"However,":[32],"basic":[34],"algorithm":[35],"is":[36,74],"unsafe,":[37],"thus,":[39],"overall":[41],"process":[42],"may":[43,49],"no":[44],"longer":[45],"be":[46,88],"complete":[47],"not":[50],"reach":[51],"actual":[53],"Recently,":[56],"Kearfott":[57],"has":[58],"proposed":[59],"safe":[61,96],"implementation":[62],"optimality-based":[64,92],"reduction.":[65],"Unfortunately,":[66],"his":[67],"method":[68],"suffers":[69],"from":[70],"some":[71],"limitations":[72],"rather":[75],"slow.":[76],"In":[77],"this":[78],"paper,":[79],"we":[80],"show":[81],"how":[82],"constraint":[83],"programming":[84],"filtering":[85],"techniques":[86],"can":[87],"used":[89],"implement":[91],"in":[94],"efficient":[98],"way.":[99]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}