solving global unconstrained optimization problems by symmetry-breaking

	solving global unconstrained optimization problems by symmetry-breaking
	Ji Xiaohui; Ma Fei Fei; Zhang Jian
	2009
会议名称	8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009
会议录名称	Proceedings of the 2009 8th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2009
页码	107-111
会议日期	43983
会议地点	Shanghai, China
收录类别	其他
出版地	United States
出版者	United States
ISBN	9780769536415
部门归属	(1) School of Information Engineering, China University of Geosciences, Beijing, China; (2) The State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences; (3) Graduate University, Chinese Academy of Sciences
摘要	Global optimization has many real-world applications. Most methods for solving it are based on search, so decreasing its search space can increase the efficiency for their solving. Symmetry-breaking is an important technique for decreasing search space and it has been widely used in SAT, CSP and so on. In this paper, we try to decrease the search space of an unconstrained optimization problem by symmetrybreaking. We present a method for extracting symmetries of an unconstrained optimization problem, and a method for constructing constraints to break those symmetries. The experimental results show that our methods are effective and efficient and symmetry-breaking can indeed increase the efficiency of global optimization problems solving. © 2009 IEEE.
关键词	Global Optimization
主办者	IEEE Computer Society; International Association for; Computer and Information Science, ACIS
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8400
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Ji Xiaohui,Ma Fei Fei,Zhang Jian. solving global unconstrained optimization problems by symmetry-breaking[C]. United States:United States,2009:107-111.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
solving global uncon（4807KB）			开放获取	--	请求全文