Symbolic computation in discrete optimization: SCDO algorithm

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-cub...

Full description

Saved in:
Bibliographic Details
Published in:Nonlinear analysis 2005-11, Vol.63 (5), p.e605-e615
Main Authors: Cardillo, Juan, Szigeti, Ferenc, Hennet, Jean Claude, Calvet, Jean Louis
Format: Article
Language:English
Subjects:
Boolean function
Discrete optimization
Symbolic computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0362-546X
1873-5215
DOI:10.1016/j.na.2005.03.056