{"title":"求解一类非线性整数规划问题的分支定界算法","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":"{\"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}","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}
A branch and bound algorithm for solving a class of nonlinear integer programming problems
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号
