{"id":"https://openalex.org/W7225620332","doi":"https://doi.org/10.3390/math14214117","title":"A Pedagogical Note on the Design of Dynamic Programming Algorithms","display_name":"A Pedagogical Note on the Design of Dynamic Programming Algorithms","publication_year":2026,"publication_date":"2026-11-09","ids":{"openalex":"https://openalex.org/W7225620332","doi":"https://doi.org/10.3390/math14214117"},"language":"en","primary_location":{"id":"doi:10.3390/math14214117","doi":"https://doi.org/10.3390/math14214117","is_oa":true,"landing_page_url":"https://doi.org/10.3390/math14214117","pdf_url":null,"source":{"id":"https://openalex.org/S4210192031","display_name":"Mathematics","issn_l":"2227-7390","issn":["2227-7390"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/math14214117","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053249974","display_name":"Bertrand M.T. Lin","orcid":"https://orcid.org/0000-0003-0456-296X","observed_orcids":["https://orcid.org/0000-0003-0456-296X"]},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]},{"id":"https://openalex.org/I177918364","display_name":"Providence University","ror":"https://ror.org/03fcpsq87","country_code":"TW","type":"education","lineage":["https://openalex.org/I177918364"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Bertrand M. T. Lin","raw_affiliation_strings":["Department of Computer Science and Information Management, International College, Providence University, Taichung 433303, Taiwan","Institute of Hospital and Health Care Administration, National Yang Ming Chiao Tung University, Hsinchu 30050, Taiwan","Institute of Information Management, National Yang Ming Chiao Tung University, Hsinchu 30050, Taiwan"],"raw_orcid":"https://orcid.org/0000-0003-0456-296X","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Management, International College, Providence University, Taichung 433303, Taiwan","institution_ids":["https://openalex.org/I177918364"]},{"raw_affiliation_string":"Institute of Hospital and Health Care Administration, National Yang Ming Chiao Tung University, Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Institute of Information Management, National Yang Ming Chiao Tung University, Hsinchu 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053249974"],"corresponding_institution_ids":["https://openalex.org/I148366613","https://openalex.org/I177918364"],"apc_list":{"value":2600,"currency":"CHF","value_usd":3137},"apc_paid":{"value":2600,"currency":"CHF","value_usd":3137},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"21","first_page":"4117","last_page":"4117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10533","display_name":"Teaching and Learning Programming","score":0.008299999870359898,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.005200000014156103,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8769999742507935},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"algorithm design","score":0.8230000138282776},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.8930000066757202},{"id":"https://openalex.org/keywords/optimization-problems","display_name":"optimization problems","score":0.8119999766349792},{"id":"https://openalex.org/keywords/sequential-decision-problems","display_name":"sequential decision problems","score":0.8629999756813049},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.8500000238418579}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7286999821662903},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6933000087738037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49239999055862427},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.4278999865055084},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.38499999046325684},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.36899998784065247},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.3666999936103821},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C119489759","wikidata":"https://www.wikidata.org/wiki/Q5508843","display_name":"Functional reactive programming","level":5,"score":0.3433000147342682},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C120558287","wikidata":"https://www.wikidata.org/wiki/Q1418502","display_name":"Procedural programming","level":4,"score":0.28940001130104065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3390/math14214117","doi":"https://doi.org/10.3390/math14214117","is_oa":true,"landing_page_url":"https://doi.org/10.3390/math14214117","pdf_url":null,"source":{"id":"https://openalex.org/S4210192031","display_name":"Mathematics","issn_l":"2227-7390","issn":["2227-7390"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.3390/math14214117","doi":"https://doi.org/10.3390/math14214117","is_oa":true,"landing_page_url":"https://doi.org/10.3390/math14214117","pdf_url":null,"source":{"id":"https://openalex.org/S4210192031","display_name":"Mathematics","issn_l":"2227-7390","issn":["2227-7390"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391477062","https://openalex.org/W2033751470","https://openalex.org/W3208342399","https://openalex.org/W2595801579","https://openalex.org/W2208377948","https://openalex.org/W6903808999","https://openalex.org/W7117995952","https://openalex.org/W3120530354","https://openalex.org/W3038834703","https://openalex.org/W2040998144"],"abstract_inverted_index":{"Dynamic":[0],"programming":[1,23,96],"is":[2],"extensively":[3],"used":[4],"to":[5,49],"formulate":[6],"and":[7,73],"solve":[8],"a":[9,26],"wide":[10],"range":[11],"of":[12,75,81,87],"optimization":[13,62],"problems,":[14,63],"especially":[15],"those":[16],"involving":[17],"sequential":[18],"decisions.":[19],"When":[20],"designing":[21],"dynamic":[22,95],"algorithms,":[24],"either":[25],"backward":[27],"or":[28],"forward":[29],"approach":[30],"can":[31],"be":[32],"employed.":[33],"Previous":[34],"studies":[35],"have":[36],"not":[37],"explicitly":[38],"addressed":[39],"the":[40,43,71,76,82,85],"choices":[41],"between":[42],"two":[44],"approaches":[45,69],"that":[46],"may":[47],"lead":[48],"different":[50,67],"time":[51],"complexities.":[52],"This":[53],"note":[54],"highlights":[55],"this":[56],"question":[57],"by":[58],"examining":[59],"four":[60],"distinct":[61],"demonstrating":[64],"how":[65],"adopting":[66],"design":[68],"impacts":[70],"efficiency":[72],"complexity":[74],"developed":[77],"algorithms.":[78,97],"Comparative":[79],"analysis":[80],"examples":[83],"suggests":[84],"option":[86],"selecting":[88],"an":[89],"effective":[90],"strategy":[91],"for":[92],"developing":[93],"efficient":[94]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-11-10T00:00:00"}