|Table of Contents|

The Necessary Conditions and the Algorithm for a Special Class of 0-1 Quadratic Programming Problem(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2018年01期
Page:
22-
Research Field:
·数学·
Publishing date:

Info

Title:
The Necessary Conditions and the Algorithm for a Special Class of 0-1 Quadratic Programming Problem
Author(s):
Chen Liang; Xu Lingling
School of Mathematical Sciences,Nanjing Normal University,Nanjing 210023,China
Keywords:
0-1 quadratic programming; 0-1 symmetric matrix; maximum value; necessary condition
PACS:
O221.4
DOI:
10.3969/j.issn.1001-4616.2018.01.005
Abstract:
In this paper,we consider a special class of 0-1 quadratic programming problem. The coefficient matrix of its objective function is a 0-1 symmetric matrix with the same element in the diagonal,and the sum of decision variable is a given positive integer. We present a necessary condition for the optimal solution,and design an efficient algorithm that can be used to solve large-scale problem.

References:

[1] 陈伟. 0-1二次规划的全局最优性条件及算法[D]. 上海:上海大学,2005.
[2]张爱君,秦新强,龚春琼. 求解0-1二次规划问题的迭代禁忌搜索算法[J]. 计算机工程,2012,38(1):140-142.
[3]周光明,王奇生,邓康. 带线性约束0-1二次规划罚参数的改进[J]. 南华大学学报(理工版),2004,18(1):67-69.
[4]王青松,范铁生. 低度图的最大团求解算法[J]. 计算机工程,2010,36(6):39-41.
[5]周旭东,王丽爱,陈峻. 启发式算法求解最大团问题研究[J]. 计算机工程与设计,2007,28(18):4 329-4 332.

Memo

Memo:
-
Last Update: 2018-03-31