QQ客服 官方微博 反馈留言

	Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
	Chen, Liangyu[1]; Xu, Yaochen[2]; Zeng, Zhenbing[3]
刊名	JOURNAL OF GLOBAL OPTIMIZATION
	2017
卷号	68页码:147-167
关键词	Heilbronn problem Rectangle partition Branch and bound method Combinatorial geometry GPGPU technology
ISSN号	0925-5001
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2195838
专题	上海大学
作者单位	1.[1]East China Normal Univ, Shanghai Key Lab Trustworthy Comp, Shanghai, Peoples R China. 2.[2]East China Normal Univ, Shanghai Key Lab Trustworthy Comp, Shanghai, Peoples R China. 3.[3]Shanghai Univ, Dept Math, Shanghai, Peoples R China.
推荐引用方式 GB/T 7714	Chen, Liangyu[1],Xu, Yaochen[2],Zeng, Zhenbing[3]. Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing[J]. JOURNAL OF GLOBAL OPTIMIZATION,2017,68:147-167.
APA	Chen, Liangyu[1],Xu, Yaochen[2],&Zeng, Zhenbing[3].(2017).Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing.JOURNAL OF GLOBAL OPTIMIZATION,68,147-167.
MLA	Chen, Liangyu[1],et al."Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing".JOURNAL OF GLOBAL OPTIMIZATION 68(2017):147-167.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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