{"title":"A branch and bound algorithm for solving a class of nonlinear integer programming problems","authors":"A. Cabot, S. Erenguc","doi":"10.1002/NAV.3800330403","DOIUrl":null,"url":null,"abstract":"On presente une methode branch and bound pour resoudre le probleme de la minimisation d'une fonction concave separable sur un ensemble polyedral convexe ou les variables sont contraintes a etre entieres. On donne des resultats de calcul","PeriodicalId":431817,"journal":{"name":"Naval Research Logistics Quarterly","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics Quarterly","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/NAV.3800330403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
On presente une methode branch and bound pour resoudre le probleme de la minimisation d'une fonction concave separable sur un ensemble polyedral convexe ou les variables sont contraintes a etre entieres. On donne des resultats de calcul
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
