Constructing test functions for global optimization using continuous formulations of graph problems

被引：11

作者：

Balasundaram, B ^{[1
]}

Butenko, S ^{[1
]}

机构：

[1] Texas A&M Univ, Dept Ind Engn, College Stn, TX 77843 USA

来源：

OPTIMIZATION METHODS & SOFTWARE | 2005年 / 20卷 / 4-5期

关键词：

maximum independent set; maximum clique; MAX CUT; monstrained global optimization; test problems;

D O I：

10.1080/10556780500139641

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A method for constructing test functions for global optimization which utilizes continuous formulations of combinatorial optimization problems is suggested. In particular, global optimization formulations for the maximum independent set, maximum clique, and MAX CUT problems on arbitrary graphs are considered, and proofs for some of them are given. A number of sample test functions based on these formulations are proposed.

引用

页码：439 / 452

页数：14