中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共5条，第1-5条

帮助

条数/页：排序方式：
	Lifting for the integer knapsack cover polyhedron 期刊论文 OAI收割 JOURNAL OF GLOBAL OPTIMIZATION, 2022, 页码: 45 作者: Chen, Wei-Kun; Chen, Liang; Dai, Yu-Hong \| 收藏 \| 浏览/下载：12/0 \| 提交时间：2023/02/07 Integer programming Cutting plane Sequential lifting MIR inequality Separation algorithm
	Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency 期刊论文 OAI收割 IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2021, 卷号: 18, 期号: 4, 页码: 4337-4352 作者: Chen, Wei-Kun; Liu, Ya-Feng; De Domenico, Antonio; Luo, Zhi-Quan; Dai, Yu-Hong \| 收藏 \| 浏览/下载：23/0 \| 提交时间：2022/04/02 Routing Cloud computing Network slicing Delays 5G mobile communication Service function chaining Data centers Energy efficiency E2E delay network function virtualization network slicing resource allocation service function chain
	An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron 期刊论文 OAI收割 JOURNAL OF GLOBAL OPTIMIZATION, 2021, 页码: 31 作者: Chen, Liang; Chen, Wei-Kun; Yang, Mu-Ming; Dai, Yu-Hong \| 收藏 \| 浏览/下载：6/0 \| 提交时间：2021/04/26 Cutting planes Exact separation Flow arc-set polyhedron Unsplittable capacitated network design
	On the complexity of sequentially lifting cover inequalities for the knapsack polytope 期刊论文 OAI收割 SCIENCE CHINA-MATHEMATICS, 2020, 页码: 10 作者: Chen, Wei-Kun; Dai, Yu-Hong \| 收藏 \| 浏览/下载：12/0 \| 提交时间：2020/05/24 integer programming sequentially lifted cover inequality complexity lifting problem
	Generalized coefficient strengthening cuts for mixed integer programming 期刊论文 OAI收割 JOURNAL OF GLOBAL OPTIMIZATION, 2018, 卷号: 70, 期号: 1, 页码: 289-306 作者: Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong \| 收藏 \| 浏览/下载：17/0 \| 提交时间：2018/07/30 Mixed integer programming Cutting plane method Separation algorithm Coefficient strengthening