QQ客服 官方微博 反馈留言

	A discrete dynamic convexized method for the max-cut problem
	Lin, Geng; Zhu, Wenxing
刊名	ANNALS OF OPERATIONS RESEARCH
	2012
卷号	196页码:371-390
关键词	Dynamic convexized method Max-cut problem Local search
ISSN号	0254-5330
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2903856
专题	福州大学
推荐引用方式 GB/T 7714	Lin, Geng,Zhu, Wenxing. A discrete dynamic convexized method for the max-cut problem[J]. ANNALS OF OPERATIONS RESEARCH,2012,196:371-390.
APA	Lin, Geng,&Zhu, Wenxing.(2012).A discrete dynamic convexized method for the max-cut problem.ANNALS OF OPERATIONS RESEARCH,196,371-390.
MLA	Lin, Geng,et al."A discrete dynamic convexized method for the max-cut problem".ANNALS OF OPERATIONS RESEARCH 196(2012):371-390.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。