{"id":"https://openalex.org/W187036117","doi":"https://doi.org/10.1023/a:1021964105322","title":"Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models","display_name":"Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W187036117","doi":"https://doi.org/10.1023/a:1021964105322","mag":"187036117"},"language":"en","primary_location":{"id":"doi:10.1023/a:1021964105322","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1021964105322","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/A5087756718","display_name":"Eugene Shragowitz","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eugene Shragowitz","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis, MN, 55455, USA","Department of Computer Science, University of Minnesota Minneapolis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN, 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of Computer Science, University of Minnesota Minneapolis, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005819428","display_name":"Habib Youssef","orcid":"https://orcid.org/0000-0001-9189-2654"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Habib Youssef","raw_affiliation_strings":["Department of Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran-, 31261, Saudi Arabia","Dept. of Computer Engineering, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran-, 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]},{"raw_affiliation_string":"Dept. of Computer Engineering, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102934089","display_name":"Bing L\u00fc","orcid":"https://orcid.org/0000-0002-1301-9398"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bing Lu","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis, MN, 55455, USA","Department of Computer Science, University of Minnesota Minneapolis, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN, 55455, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of Computer Science, University of Minnesota Minneapolis, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.02890437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"7","issue":"1","first_page":"5","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9397000074386597,"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"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9397000074386597,"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/T10661","display_name":"biodegradable polymer synthesis and properties","score":0.9352999925613403,"subfield":{"id":"https://openalex.org/subfields/2502","display_name":"Biomaterials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6117401123046875},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.556559145450592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5243121385574341},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4578179121017456},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.42789626121520996},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.42455318570137024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4114808142185211},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41139212250709534},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3965281546115875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3448852300643921},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18895789980888367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16350585222244263},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13014823198318481}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6117401123046875},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.556559145450592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5243121385574341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4578179121017456},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.42789626121520996},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.42455318570137024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4114808142185211},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41139212250709534},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3965281546115875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3448852300643921},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18895789980888367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16350585222244263},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13014823198318481},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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":2,"locations":[{"id":"doi:10.1023/a:1021964105322","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1021964105322","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:RePEc:spr:jcomop:v:7:y:2003:i:1:d:10.1023_a:1021964105322","is_oa":false,"landing_page_url":"http://link.springer.com/10.1023/A:1021964105322","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":12,"referenced_works":["https://openalex.org/W15130301","https://openalex.org/W1559850974","https://openalex.org/W1971520355","https://openalex.org/W2011039300","https://openalex.org/W2038345112","https://openalex.org/W2067783861","https://openalex.org/W2087162576","https://openalex.org/W2134993085","https://openalex.org/W2147256558","https://openalex.org/W2752885492","https://openalex.org/W4285719527","https://openalex.org/W6600603869"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W4214487273","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}