一种有效的子模函数最大化的分支割算法

{"title":"一种有效的子模函数最大化的分支割算法","authors":"Naoya Uematsu, S. Umetani, Y. Kawahara","doi":"10.15807/jorsj.63.41","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"AN EFFICIENT BRANCH-AND-CUT ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION\",\"authors\":\"Naoya Uematsu, S. Umetani, Y. Kawahara\",\"doi\":\"10.15807/jorsj.63.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":51107,\"journal\":{\"name\":\"Journal of the Operations Research Society of Japan\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the Operations Research Society of Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15807/jorsj.63.41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/jorsj.63.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}