摘要
Inthispaper,weproposeanewbranchandboundalgorithmforthesolutionoflargescaleseparableconcaveprogrammingproblems.Thelargestdistancebisection(LDB)techniqueisproposedtodividerectangleintosub-rectangleswhenoneproblemisbranchedintotwosubproblems.ItisprovedthattheLDBmethodisanormalrectanglesubdivision(NRS).Numericaltestsonproblemswithdimensionsfrom100to10000showthattheproposedbranchandboundalgorithmisefficientforsolvinglargescaleseparableconcaveprogrammingproblems,andconvergencerateisfasterthanω-subdivisionmethod.
出版日期
2004年06月16日(中国期刊网平台首次上网日期,不代表论文的发表时间)