北京科技大学主页平台管理系统邵立珍--中文主页-- An objective space cut and bound algorithm for convex multiplicative programmes Shao, L.* and Ehrgott, M. (2014), Journal of Global Optimization, 58(4):711-728.

论文成果

中文主页 - 科学研究 - 论文成果

An objective space cut and bound algorithm for convex multiplicative programmes Shao, L.* and Ehrgott, M. (2014), Journal of Global Optimization, 58(4):711-728.

点击次数：

是否译文：否

上一条：: Primal and dual multi-objective linear programming algorithms for linea multiplicative programmes Shao, L.* and Ehrgott, M. (2016), Optimization, 65(2): 415-431

下一条：: Bi-objective support vector machine and its application in microarray classification Shao, L.* et al (2014), 2014 IEEE Symposium on Computational Intelligence Multi-Criteria Decision-Making (MCDM), 164-169