{"id":"https://openalex.org/W2033166141","doi":"https://doi.org/10.1145/97808.97852","title":"Implementing the recursive APL code for dynamic programming","display_name":"Implementing the recursive APL code for dynamic programming","alternate_titles":[],"publication_year":1990,"publication_date":"1990-05-01","ids":{"openalex":"https://openalex.org/W2033166141","doi":"https://doi.org/10.1145/97808.97852","mag":"2033166141"},"language":"en","primary_location":{"id":"doi:10.1145/97808.97852","doi":"https://doi.org/10.1145/97808.97852","is_oa":false,"landing_page_url":"https://doi.org/10.1145/97808.97852","pdf_url":null,"source":{"id":"https://openalex.org/S7407088270","display_name":"International Conference on APL (APL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conference proceedings on APL 90: for the future","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2033166141"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5109215787","display_name":"Edward Y. H. Lin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Edward Y. H. Lin","raw_affiliation_strings":["Faculty of Administration, University of New Brunswick, Fredericton, New Brunswick E3B 5A3, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Administration, University of New Brunswick, Fredericton, New Brunswick E3B 5A3, Canada","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087437386","display_name":"Dennis L. Bricker","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Dennis L. Bricker","raw_affiliation_strings":["Department of Industrial Engineering, The University of Iowa, Iowa City, Iowa","Department of Industrial Engineering, The University of Iowa, Iowa City, Iowa#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, The University of Iowa, Iowa City, Iowa","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"Department of Industrial Engineering, The University of Iowa, Iowa City, Iowa#TAB#","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0217,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":92},"biblio":{"volume":null,"issue":null,"first_page":"239","last_page":"250"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.8330000042915344,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.8330000042915344,"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/T13806","display_name":"Mathematical and Computational Methods","score":0.07810000330209732,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03009999915957451,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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.9490000009536743},{"id":"https://openalex.org/keywords/apl-programming-language","display_name":"APL programming language","score":0.8450000286102295},{"id":"https://openalex.org/keywords/recursive-algorithm","display_name":"recursive algorithm","score":0.7070000171661377},{"id":"https://openalex.org/keywords/deterministic-dynamic-programming","display_name":"deterministic dynamic programming","score":0.921999990940094},{"id":"https://openalex.org/keywords/optimization","display_name":"optimization","score":0.3930000066757202}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7720286846160889},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6879545450210571},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5034331679344177},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34237140417099},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/97808.97852","doi":"https://doi.org/10.1145/97808.97852","is_oa":false,"landing_page_url":"https://doi.org/10.1145/97808.97852","pdf_url":null,"source":{"id":"https://openalex.org/S7407088270","display_name":"International Conference on APL (APL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conference proceedings on APL 90: for the future","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2107857629","https://openalex.org/W2911633892","https://openalex.org/W4256185527"],"related_works":["https://openalex.org/W2036194463","https://openalex.org/W1978527854","https://openalex.org/W2095111705","https://openalex.org/W4233789301","https://openalex.org/W2004942007","https://openalex.org/W7098530080","https://openalex.org/W2225064413","https://openalex.org/W3120530354","https://openalex.org/W3161325446","https://openalex.org/W2547786246"],"abstract_inverted_index":{"Despite":[0],"the":[1,12,23,41,54,103],"importance":[2],"and":[3,14],"wide":[4],"applicability":[5],"of":[6,16,25,57,79,88,97,105,108],"dynamic":[7,18,49,70,89,109],"programming":[8,19,50,90,110],"technique":[9],"in":[10,44],"optimization,":[11],"complexity":[13],"uniqueness":[15],"various":[17,86],"models":[20],"often":[21],"make":[22],"comprehension":[24],"their":[26],"solution":[27,66],"procedures":[28],"difficult,":[29],"particularly":[30],"for":[31,68],"a":[32,64,77],"novice.":[33],"Although":[34],"it":[35,59],"can":[36],"be":[37,84],"argued":[38],"that,":[39],"unlike":[40],"Simplex":[42],"method":[43],"linear":[45],"programming,":[46],"no":[47],"general":[48],"algorithm":[51],"exists,":[52],"with":[53,92],"recursive":[55],"capability":[56],"APL,":[58],"is":[60],"feasible":[61],"to":[62,101],"develop":[63],"\u201csystematic\u201d":[65],"approach":[67],"deterministic":[69],"programming.":[71],"In":[72],"this":[73],"paper,":[74],"we":[75],"introduce":[76],"set":[78],"such":[80],"APL":[81],"code":[82],"developed":[83],"solve":[85],"types":[87],"problems":[91],"minor":[93],"modifications":[94],"on":[95],"some":[96],"its":[98],"key":[99],"functions":[100],"accommodate":[102],"nature":[104],"each":[106],"type":[107],"problems.":[111]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2033166141","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
