{"id":"https://openalex.org/W1977445660","doi":"https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q","title":"Minimizing the complexity of an activity network","display_name":"Minimizing the complexity of an activity network","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1977445660","doi":"https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q","mag":"1977445660"},"language":"en","primary_location":{"id":"doi:10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5033976425","display_name":"Jerzy Kamburowski","orcid":null},"institutions":[{"id":"https://openalex.org/I90871651","display_name":"University of Toledo","ror":"https://ror.org/01pbdzh19","country_code":"US","type":"education","lineage":["https://openalex.org/I90871651"]},{"id":"https://openalex.org/I931278978","display_name":"College of Business Administration","ror":"https://ror.org/03x1zq178","country_code":"LV","type":"education","lineage":["https://openalex.org/I931278978"]}],"countries":["LV","US"],"is_corresponding":false,"raw_author_name":"Jerzy Kamburowski","raw_affiliation_strings":["College of Business Administration, University of Toledo, Toledo, Ohio 43606-3390","College of Business Administration, University of Toledo, Toledo, Ohio 43606\u20103390"],"affiliations":[{"raw_affiliation_string":"College of Business Administration, University of Toledo, Toledo, Ohio 43606-3390","institution_ids":["https://openalex.org/I90871651"]},{"raw_affiliation_string":"College of Business Administration, University of Toledo, Toledo, Ohio 43606\u20103390","institution_ids":["https://openalex.org/I931278978"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033927904","display_name":"David J. Michael","orcid":null},"institutions":[{"id":"https://openalex.org/I4210142445","display_name":"SA Technologies (United States)","ror":"https://ror.org/046qmva50","country_code":"US","type":"company","lineage":["https://openalex.org/I4210142445"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David J. Michael","raw_affiliation_strings":["i2 Technologies, 909 E. Las Colinas Boulevard, 16th Floor, Irving, Texas 75039"],"affiliations":[{"raw_affiliation_string":"i2 Technologies, 909 E. Las Colinas Boulevard, 16th Floor, Irving, Texas 75039","institution_ids":["https://openalex.org/I4210142445"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068222606","display_name":"Matthias F. Stallmann","orcid":"https://orcid.org/0000-0003-1199-156X"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthias F.M. Stallmann","raw_affiliation_strings":["Department of Computer Science, North Carolina State University, Raleigh, North Carolina 27695-8206","Department of Computer Science North Carolina State University, Raleigh, North Carolina 27695-8206"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Carolina State University, Raleigh, North Carolina 27695-8206","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"Department of Computer Science North Carolina State University, Raleigh, North Carolina 27695-8206","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068222606"],"corresponding_institution_ids":["https://openalex.org/I137902535"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5045,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.68797537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"36","issue":"1","first_page":"47","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9986000061035156,"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.9986000061035156,"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/T10430","display_name":"Software Engineering Techniques and Practices","score":0.9483000040054321,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10395","display_name":"Construction Project Management and Performance","score":0.9363999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6317908763885498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.612130343914032},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5350106358528137},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5257126688957214},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49092939496040344},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4777897298336029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3255854845046997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3180280923843384},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12583515048027039}],"concepts":[{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6317908763885498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.612130343914032},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5350106358528137},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5257126688957214},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49092939496040344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4777897298336029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3255854845046997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3180280923843384},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12583515048027039},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.9528","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.9528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.engr.ncsu.edu/mfms/Publications/2000-Networks-Kamburowski.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W68377398","https://openalex.org/W194802098","https://openalex.org/W1655990431","https://openalex.org/W1964119857","https://openalex.org/W1978516157","https://openalex.org/W1979740015","https://openalex.org/W1995205301","https://openalex.org/W2044263435","https://openalex.org/W2045899462","https://openalex.org/W2050783363","https://openalex.org/W2053150849","https://openalex.org/W2079669620","https://openalex.org/W2144130180","https://openalex.org/W2168903052","https://openalex.org/W2400084195","https://openalex.org/W2477209147","https://openalex.org/W2798344481","https://openalex.org/W3106992008"],"related_works":["https://openalex.org/W2544839741","https://openalex.org/W2810064750","https://openalex.org/W3036572561","https://openalex.org/W1885735754","https://openalex.org/W2515218844","https://openalex.org/W3045564025","https://openalex.org/W1965970232","https://openalex.org/W2033676320","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"When":[0],"an":[1,70],"activity-on-arc":[2],"(AoA)":[3],"project":[4,32],"network":[5,72],"is":[6],"to":[7,13],"be":[8],"constructed,":[9],"one":[10],"typically":[11],"seeks":[12],"minimize":[14],"the":[15,26,38,52,56,74,78,85],"number":[16,57,87],"of":[17,29,43,58,80,88],"dummy":[18,59],"arcs.":[19,60],"Recent":[20],"investigations":[21],"have":[22],"shown,":[23],"however,":[24],"that":[25],"computational":[27],"effort":[28],"many":[30],"network-oriented":[31],"management":[33],"techniques":[34],"depends":[35],"strongly":[36],"on":[37],"so-called":[39],"complexity":[40],"index":[41],"(CI)":[42],"a":[44,64],"network.":[45],"We":[46,61],"show":[47],"other":[48],"justifications":[49],"for":[50,68],"minimizing":[51],"CI":[53,76],"rather":[54],"than":[55],"also":[62],"present":[63],"polynomial":[65],"time":[66],"algorithm":[67],"constructing":[69],"AoA":[71,82],"with":[73],"minimum":[75,86],"in":[77],"class":[79],"all":[81],"networks":[83],"having":[84],"nodes.":[89],"\u00a9":[90],"2000":[91],"John":[92],"Wiley":[93],"&":[94],"Sons,":[95],"Inc.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}