{"id":"https://openalex.org/W1540371123","doi":"https://doi.org/10.1023/a:1018968024833","title":"Fast algebraic methods for interval constraint problems","display_name":"Fast algebraic methods for interval constraint problems","publication_year":1997,"publication_date":"1997-04-01","ids":{"openalex":"https://openalex.org/W1540371123","doi":"https://doi.org/10.1023/a:1018968024833","mag":"1540371123"},"language":"en","primary_location":{"id":"doi:10.1023/a:1018968024833","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018968024833","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"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":"Annals of Mathematics and Artificial Intelligence","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/A5013541546","display_name":"Peter B. Ladkin","orcid":null},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter B. Ladkin","raw_affiliation_strings":["Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Postfach 10 01 31, D-33501, Bielefeld, Germany","Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Postfach 10 01 31, D&dash;33501 Bielefeld, Germany E&dash;mail&colon; ladkin@techfak.uni&dash;bielefeld.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Postfach 10 01 31, D-33501, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]},{"raw_affiliation_string":"Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Postfach 10 01 31, D&dash;33501 Bielefeld, Germany E&dash;mail&colon; ladkin@techfak.uni&dash;bielefeld.de#TAB#","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111934545","display_name":"Alexander Reinefeld","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Reinefeld","raw_affiliation_strings":["Paderborn Center for Parallel Computing, F\u00fcrstenallee 7, D-33095, Paderborn, Germany","Paderborn Center for Parallel Computing, F\u00fcrstenallee 7, D&dash;33095 Paderborn, Germany E&dash;mail&colon; [email\u00a0protected]&dash;paderborn.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Paderborn Center for Parallel Computing, F\u00fcrstenallee 7, D-33095, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Paderborn Center for Parallel Computing, F\u00fcrstenallee 7, D&dash;33095 Paderborn, Germany E&dash;mail&colon; [email\u00a0protected]&dash;paderborn.de#TAB#","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":2.0791,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.87556545,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":"3-4","first_page":"383","last_page":"411"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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.9998000264167786,"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.9966999888420105,"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.9828000068664551,"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/local-consistency","display_name":"Local consistency","score":0.8254672288894653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6025266647338867},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.5577079057693481},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5545395016670227},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5051608681678772},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4949299693107605},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.49460098147392273},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.42584049701690674},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41847431659698486},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.40660884976387024},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4017758369445801},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3238339424133301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2763267159461975},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27329495549201965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19622686505317688},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1493707299232483},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.09428295493125916}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8254672288894653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6025266647338867},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.5577079057693481},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5545395016670227},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5051608681678772},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4949299693107605},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.49460098147392273},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.42584049701690674},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41847431659698486},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.40660884976387024},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4017758369445801},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3238339424133301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2763267159461975},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27329495549201965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19622686505317688},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1493707299232483},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.09428295493125916},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1018968024833","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018968024833","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"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":"Annals of Mathematics and Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4399999976158142,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W852874","https://openalex.org/W84772334","https://openalex.org/W128308381","https://openalex.org/W153144736","https://openalex.org/W159907047","https://openalex.org/W1488938944","https://openalex.org/W1525954809","https://openalex.org/W1528419757","https://openalex.org/W1550360904","https://openalex.org/W1557143830","https://openalex.org/W1561939243","https://openalex.org/W1620410031","https://openalex.org/W1724705413","https://openalex.org/W1836049508","https://openalex.org/W1976837156","https://openalex.org/W1992205482","https://openalex.org/W1996011776","https://openalex.org/W2023648368","https://openalex.org/W2037262533","https://openalex.org/W2037694584","https://openalex.org/W2039392113","https://openalex.org/W2069683773","https://openalex.org/W2090310951","https://openalex.org/W2096426717","https://openalex.org/W2119456262","https://openalex.org/W2130182605","https://openalex.org/W2134358914","https://openalex.org/W2135432705","https://openalex.org/W2161484642","https://openalex.org/W2913256821","https://openalex.org/W3012525065","https://openalex.org/W4253268390","https://openalex.org/W4293176479"],"related_works":["https://openalex.org/W2118249115","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W4303044088","https://openalex.org/W96881443","https://openalex.org/W2216566009","https://openalex.org/W2141935412","https://openalex.org/W2140769824","https://openalex.org/W2139423517"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2016-06-24T00:00:00"}
