{"id":"https://openalex.org/W7171531893","doi":"https://doi.org/10.48550/arxiv.2607.23009","title":"Recycling computational processes of dynamic programming for combinatorial optimization problems: a reservoir computing approach","display_name":"Recycling computational processes of dynamic programming for combinatorial optimization problems: a reservoir computing approach","publication_year":2026,"publication_date":"2026-07-25","ids":{"openalex":"https://openalex.org/W7171531893","doi":"https://doi.org/10.48550/arxiv.2607.23009"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.23009","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23009","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.23009","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5143750460","display_name":"Sora Todaka","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Todaka, Sora","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103429876","display_name":"Akihiro Yamamoto","orcid":"https://orcid.org/0009-0008-6914-2580"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yamamoto, Akihiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5090119956","display_name":"Nozomi Akashi","orcid":"https://orcid.org/0000-0002-8358-3138"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Akashi, Nozomi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12611","display_name":"Neural Networks and Reservoir Computing","score":0.7815999984741211,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12611","display_name":"Neural Networks and Reservoir Computing","score":0.7815999984741211,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.07419999688863754,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.01209999993443489,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.6953999996185303},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6753000020980835},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.614799976348877},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5325999855995178},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4941999912261963},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4909000098705292},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3806999921798706}],"concepts":[{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.6953999996185303},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6753000020980835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6712999939918518},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.614799976348877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5913000106811523},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5325999855995178},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C135796866","wikidata":"https://www.wikidata.org/wiki/Q7315328","display_name":"Reservoir computing","level":4,"score":0.33970001339912415},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.30720001459121704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.296999990940094},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2962000072002411},{"id":"https://openalex.org/C2778668878","wikidata":"https://www.wikidata.org/wiki/Q6380338","display_name":"Reservoir simulation","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.23009","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23009","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.23009","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23009","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Reusing":[0],"previously":[1],"computed":[2],"results":[3,71,125,146],"is":[4,44],"a":[5,20,66,127],"long-standing":[6],"principle":[7],"for":[8,76,82],"reducing":[9],"computational":[10,25,135],"cost,":[11],"but":[12],"such":[13,56],"reuse":[14],"has":[15],"largely":[16],"been":[17],"confined":[18],"to":[19,46,54,87],"single":[21],"problem's":[22],"computation.":[23],"Sharing":[24],"processes":[26,140],"across":[27],"multiple":[28,139],"simultaneously":[29],"solved":[30],"problems":[31,79],"remains":[32],"possible":[33],"in":[34,137],"principle,":[35],"yet":[36],"designing":[37],"algorithms":[38,57],"that":[39,68],"exploit":[40],"nontrivial":[41],"cross-task":[42],"relationships":[43],"difficult":[45],"do":[47],"manually.":[48],"Here,":[49],"we":[50,64],"use":[51],"machine":[52],"learning":[53],"discover":[55],"automatically.":[58],"Specifically,":[59],"based":[60],"on":[61,97],"reservoir":[62],"computing,":[63],"propose":[65],"method":[67],"uses":[69],"computation":[70,118],"recorded":[72],"by":[73],"dynamic":[74,107],"programming":[75,108],"combinatorial":[77,90],"optimization":[78,91],"as":[80],"features":[81,115],"linear":[83],"regression,":[84],"leveraging":[85],"them":[86],"assist":[88],"other":[89],"computations.":[92],"We":[93],"validate":[94],"the":[95,98,106],"approach":[96],"traveling":[99],"salesman":[100],"and":[101,116,143,147],"subset":[102],"sum":[103],"problems.":[104],"Multiplexing":[105],"process":[109],"improves":[110],"approximation":[111],"accuracy":[112],"over":[113],"generic":[114],"reduces":[117],"time":[119],"compared":[120],"with":[121],"independent":[122],"solutions.":[123],"These":[124],"suggest":[126],"new":[128],"form":[129],"of":[130],"computation,":[131],"distinct":[132],"from":[133],"conventional":[134],"design,":[136],"which":[138],"efficiently":[141],"share":[142],"recycle":[144],"intermediate":[145],"states.":[148]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2026-07-29T00:00:00"}
