{"id":"https://openalex.org/W2165118931","doi":"https://doi.org/10.1287/opre.27.2.225","title":"A Dynamic Programming Algorithm for Decision CPM Networks","display_name":"A Dynamic Programming Algorithm for Decision CPM Networks","publication_year":1979,"publication_date":"1979-04-01","ids":{"openalex":"https://openalex.org/W2165118931","doi":"https://doi.org/10.1287/opre.27.2.225","mag":"2165118931"},"language":"en","primary_location":{"id":"doi:10.1287/opre.27.2.225","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.27.2.225","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","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/A5064163048","display_name":"Thomas J. Hindelang","orcid":null},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas J. Hindelang","raw_affiliation_strings":["Drexel University, Philadelphia, Pennsylvania"],"affiliations":[{"raw_affiliation_string":"Drexel University, Philadelphia, Pennsylvania","institution_ids":["https://openalex.org/I72816309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021947397","display_name":"John F. Muth","orcid":"https://orcid.org/0000-0002-2488-7721"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John F. Muth","raw_affiliation_strings":["Indiana University, Bloomington, Indiana"],"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, Indiana","institution_ids":["https://openalex.org/I4210119109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064163048"],"corresponding_institution_ids":["https://openalex.org/I72816309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":118,"citation_normalized_percentile":{"value":0.30513514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"2","first_page":"225","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9919999837875366,"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/T11182","display_name":"Auction Theory and Applications","score":0.9919999837875366,"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/T12288","display_name":"Optimization and Search Problems","score":0.9835000038146973,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9815999865531921,"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/computer-science","display_name":"Computer science","score":0.6929352283477783},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6127634644508362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5833607316017151},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5379728674888611},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5195313096046448},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5020818710327148},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49984097480773926},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.43852266669273376},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.42875349521636963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17509999871253967}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6929352283477783},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6127634644508362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5833607316017151},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5379728674888611},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5195313096046448},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5020818710327148},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49984097480773926},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.43852266669273376},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.42875349521636963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17509999871253967},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/opre.27.2.225","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.27.2.225","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:oropre:v:27:y:1979:i:2:p:225-241","is_oa":false,"landing_page_url":"http://doi.org/10.1287/opre.27.2.225","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":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1592032946","https://openalex.org/W1964438501","https://openalex.org/W2009683816","https://openalex.org/W2015247562","https://openalex.org/W2062533874","https://openalex.org/W2091364465","https://openalex.org/W2093150123","https://openalex.org/W2094826100","https://openalex.org/W2100890245","https://openalex.org/W2103054960","https://openalex.org/W2144931885","https://openalex.org/W2150475794","https://openalex.org/W2341171179","https://openalex.org/W2796610752","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2139895272","https://openalex.org/W2015682010","https://openalex.org/W2066685890","https://openalex.org/W1982719520","https://openalex.org/W2750229969","https://openalex.org/W2990947859","https://openalex.org/W2085449023","https://openalex.org/W3146992596","https://openalex.org/W3124982508","https://openalex.org/W2127558517"],"abstract_inverted_index":{"This":[0,183],"paper":[1],"proposes":[2],"a":[3,14,136,177,190],"dynamic":[4],"programming":[5,47],"algorithm":[6,123,157,219],"for":[7,54,167,193,199,216],"decision":[8,76],"CPM":[9],"(DCPM)":[10],"networks.":[11],"DCPM":[12,55],"is":[13,158],"natural,":[15],"powerful,":[16],"and":[17,49,58,104,196,212],"general":[18,45],"way":[19],"of":[20,56,61,75,86,119,128,147,155,171],"handling":[21],"the":[22,50,73,87,93,102,117,120,140,145,153,156,164,194,202,218],"discrete-time/cost-tradeoff":[23],"problem.":[24,121],"Solution":[25],"approaches":[26,42,63],"developed":[27],"to":[28,35,100,220],"date":[29],"have":[30,43,64,110],"not":[31],"been":[32,44,111],"efficient":[33],"enough":[34],"handle":[36,221],"realistically":[37],"sized":[38],"problems.":[39,223],"The":[40,122],"main":[41],"integer":[46],"algorithms":[48,94],"specialized":[51],"branch-and-bound":[52],"methods":[53],"Crowston":[57],"Wagner.":[59],"Both":[60],"these":[62,129],"many":[65],"inherent":[66],"shortcomings":[67],"solution":[68,108,141,166],"times":[69,109,142],"grow":[70],"exponentially":[71],"with":[72,175],"number":[74,146,170],"nodes,":[77],"storage":[78],"requirements":[79],"quickly":[80],"become":[81],"excessive,":[82],"pre-processing":[83],"or":[84],"decomposition":[85],"problem":[88,208],"must":[89],"be":[90,97],"undertaken":[91],"before":[92],"themselves":[95],"can":[96],"called":[98],"upon":[99],"solve":[101],"problem,":[103],"large":[105],"variations":[106],"in":[107,116,139,180,188,197],"found":[112],"based":[113,143],"on":[114,144],"differences":[115],"structure":[118,154],"presented":[124],"here":[125],"overcomes":[126],"all":[127],"shortcomings.":[130],"Most":[131],"significantly,":[132],"it":[133,161],"exhibits":[134],"only":[135,176],"linear":[137],"growth":[138],"connections":[148],"between":[149],"nodes.":[150],"In":[151],"addition,":[152],"such":[159],"that":[160],"simultaneously":[162],"determines":[163],"optimal":[165],"any":[168],"desired":[169],"project":[172,195,203],"due":[173,204],"dates":[174],"slight":[178],"increase":[179],"computer":[181],"time.":[182],"feature":[184],"provides":[185],"valuable":[186],"information":[187],"performing":[189],"sensitivity":[191],"analysis":[192],"preparing":[198],"negotiations":[200],"about":[201],"date,":[205],"etc.":[206],"Test":[207],"results":[209],"are":[210,214],"reported":[211],"recommendations":[213],"made":[215],"extending":[217],"related":[222]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}