{"id":"https://openalex.org/W2056640952","doi":"https://doi.org/10.1016/0304-3975(92)90389-w","title":"Integer programs for logic constraint satisfaction","display_name":"Integer programs for logic constraint satisfaction","publication_year":1992,"publication_date":"1992-04-01","ids":{"openalex":"https://openalex.org/W2056640952","doi":"https://doi.org/10.1016/0304-3975(92)90389-w","mag":"2056640952"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(92)90389-w","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(92)90389-w","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5078254963","display_name":"Angelo Monfroglio","orcid":"https://orcid.org/0009-0000-1458-2951"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Angelo Monfroglio","raw_affiliation_strings":["OMAR Technical Institute, Novara, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"OMAR Technical Institute, Novara, Italy#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078254963"],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.4495,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89341903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"97","issue":"1","first_page":"105","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"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.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.98580002784729,"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/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7530206441879272},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7141715288162231},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6655483245849609},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6483485102653503},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.630180299282074},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5376336574554443},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5344345569610596},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5235997438430786},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.4971943199634552},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4720371961593628},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.46903643012046814},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4670115113258362},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4445626735687256},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.400615394115448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3773425817489624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2416301965713501},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06380608677864075},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.061598509550094604}],"concepts":[{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7530206441879272},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7141715288162231},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6655483245849609},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6483485102653503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.630180299282074},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5376336574554443},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5344345569610596},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5235997438430786},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.4971943199634552},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4720371961593628},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.46903643012046814},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4670115113258362},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4445626735687256},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.400615394115448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3773425817489624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2416301965713501},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06380608677864075},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.061598509550094604},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(92)90389-w","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(92)90389-w","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W41104307","https://openalex.org/W86044744","https://openalex.org/W115757739","https://openalex.org/W116065029","https://openalex.org/W180996895","https://openalex.org/W1518773244","https://openalex.org/W1603398055","https://openalex.org/W1970515221","https://openalex.org/W1972577005","https://openalex.org/W1980584633","https://openalex.org/W1985318592","https://openalex.org/W1999038767","https://openalex.org/W2002478775","https://openalex.org/W2002636386","https://openalex.org/W2003813631","https://openalex.org/W2009683816","https://openalex.org/W2011078904","https://openalex.org/W2014979043","https://openalex.org/W2031954818","https://openalex.org/W2033755422","https://openalex.org/W2034960752","https://openalex.org/W2036265926","https://openalex.org/W2040101882","https://openalex.org/W2041881465","https://openalex.org/W2050315723","https://openalex.org/W2052553211","https://openalex.org/W2055978814","https://openalex.org/W2061734130","https://openalex.org/W2066356146","https://openalex.org/W2069683773","https://openalex.org/W2071449896","https://openalex.org/W2076680677","https://openalex.org/W2084692127","https://openalex.org/W2086456955","https://openalex.org/W2092663027","https://openalex.org/W2119456262","https://openalex.org/W2123396057","https://openalex.org/W2151720296","https://openalex.org/W2327315803","https://openalex.org/W2401610261","https://openalex.org/W2570911113","https://openalex.org/W2611147814","https://openalex.org/W2795674018","https://openalex.org/W2984454117","https://openalex.org/W3200447518","https://openalex.org/W4233025918","https://openalex.org/W4253845860","https://openalex.org/W4404745603","https://openalex.org/W6601674239","https://openalex.org/W6603474794","https://openalex.org/W6604740839","https://openalex.org/W6631065725","https://openalex.org/W6644040475","https://openalex.org/W6654465079","https://openalex.org/W6658574948","https://openalex.org/W6659157516","https://openalex.org/W6659573362","https://openalex.org/W6660897098","https://openalex.org/W6668290326","https://openalex.org/W6669647044","https://openalex.org/W6678706456","https://openalex.org/W6701294544"],"related_works":["https://openalex.org/W2097415053","https://openalex.org/W1486916474","https://openalex.org/W1496100162","https://openalex.org/W1820477541","https://openalex.org/W1770162292","https://openalex.org/W115413730","https://openalex.org/W2334636689","https://openalex.org/W1593899949","https://openalex.org/W2365854838","https://openalex.org/W2056640952"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}