{"title":"A dynamic programming algorithm to find all solutions in a neighborhood of the optimum","authors":"M. Waterman, Thomas H. Byers","doi":"10.1016/0025-5564(85)90096-3","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":383810,"journal":{"name":"Bellman Prize in Mathematical Biosciences","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"91","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bellman Prize in Mathematical Biosciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/0025-5564(85)90096-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}