Symbolic computation in discrete optimization: SCDO algorithm

被引：0

作者：

Cardillo, Juan ^{[1
]}

Szigeti, Ferenc ^{[1
]}

Hennet, Jean Claude ^{[2
]}

Calvet, Jean Louis ^{[2
]}

机构：

[1] Univ Los Andes, Escuela Ingn Sistemas, Dept Sistemas Control, Merida, Venezuela

[2] CNRS, LAAS, F-31077 Toulouse, France

来源：

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS | 2005年 / 63卷 / 5-7期

关键词：

Discrete optimization; Boolean function; Symbolic computation;

D O I：

10.1016/j.na.2005.03.056

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper addresses the problem of symbolic optimization of functions defined over finite discrete sets. In connection with the main goal of the paper, several interesting properties of Boolean functions are discovered, related to a particular function representation, over the vertices of hyper-cube {-1, 1}(k). The symbolic algorithm which is proposed has essentially the same computational complexity as the classical search methods, with the advantage of its possible application to parametric optimization. (C) 2005 Elsevier Ltd. All rights reserved.

引用

页码：E605 / E615

页数：11