{"id":"https://openalex.org/W2001897285","doi":"https://doi.org/10.1007/s10601-005-2814-0","title":"Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities","display_name":"Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W2001897285","doi":"https://doi.org/10.1007/s10601-005-2814-0","mag":"2001897285"},"language":"en","primary_location":{"id":"doi:10.1007/s10601-005-2814-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10601-005-2814-0","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"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":"Constraints","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/A5026418585","display_name":"Petr Vil\u00edm","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Vil\u00edm","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 2/25, Praha, 1, Czech Republic","Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 2/25, Praha, 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048241440","display_name":"Roman Bart\u00e1k","orcid":"https://orcid.org/0000-0002-6717-8175"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Roman Bart\u00e1k","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 2/25, Praha, 1, Czech Republic","Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 2/25, Praha, 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059158185","display_name":"Ond\u0159ej \u010cepek","orcid":"https://orcid.org/0000-0002-6325-0897"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ond\u0159ej \u010cepek","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 2/25, Praha, 1, Czech Republic","Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 2/25, Praha, 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic 1","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026418585"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":8.6409,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.97151424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"10","issue":"4","first_page":"403","last_page":"425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9984999895095825,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9830999970436096,"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/unary-operation","display_name":"Unary operation","score":0.9298025369644165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6282693147659302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5904492139816284},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5179840326309204},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.49931883811950684},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4974718391895294},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47732430696487427},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4495285749435425},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44293084740638733},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4377312660217285},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3403680622577667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2553126811981201},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2265051305294037},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.19582194089889526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15868383646011353},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11692944169044495},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08693069219589233}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.9298025369644165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6282693147659302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5904492139816284},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5179840326309204},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.49931883811950684},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4974718391895294},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47732430696487427},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4495285749435425},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44293084740638733},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4377312660217285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3403680622577667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2553126811981201},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2265051305294037},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.19582194089889526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15868383646011353},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11692944169044495},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08693069219589233},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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":1,"locations":[{"id":"doi:10.1007/s10601-005-2814-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10601-005-2814-0","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"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":"Constraints","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":19,"referenced_works":["https://openalex.org/W37124424","https://openalex.org/W49511221","https://openalex.org/W54124430","https://openalex.org/W106123087","https://openalex.org/W1490499382","https://openalex.org/W1517248951","https://openalex.org/W1530618466","https://openalex.org/W1535560884","https://openalex.org/W1547956499","https://openalex.org/W1555523867","https://openalex.org/W1606408728","https://openalex.org/W1610326124","https://openalex.org/W2011039300","https://openalex.org/W2020459421","https://openalex.org/W2028613991","https://openalex.org/W2127600788","https://openalex.org/W4285719527","https://openalex.org/W6604314124","https://openalex.org/W7024278654"],"related_works":["https://openalex.org/W4291309325","https://openalex.org/W2950474130","https://openalex.org/W4313469555","https://openalex.org/W2737452945","https://openalex.org/W1547011777","https://openalex.org/W1514706798","https://openalex.org/W1985899403","https://openalex.org/W2130380026","https://openalex.org/W1552893733","https://openalex.org/W2611323174"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}