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!
cited_by cdi_FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323
cites cdi_FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323
container_end_page e615
container_issue 5
container_start_page e605
container_title Nonlinear analysis
container_volume 63
creator Cardillo, Juan
Szigeti, Ferenc
Hennet, Jean Claude
Calvet, Jean Louis
description 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.
doi_str_mv 10.1016/j.na.2005.03.056
format article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00860390v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0362546X05003834</els_id><sourcerecordid>oai_HAL_hal_00860390v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323</originalsourceid><addsrcrecordid>eNp1kD1PwzAQhi0EEqWwM2ZlSDjbSZxWYqjKp1SpQzuwWRfboa6SuLJNpfLrSSliYzrpvfc56R5CbilkFGh5v816zBhAkQHPoCjPyIhWgqcFo8U5GQEvWVrk5fsluQphCwBU8HJEHlaHrnatVYly3e4zYrSuT2yfaBuUN9EkbhdtZ79-FtNkNX9cJth-OG_jprsmFw22wdz8zjFZPz-t56_pYvnyNp8tUsVZFdOmLqpKNTXTolR5XTMucshzRYViujCC5hMEJlAzpKyqJ03eUM40oqgYcsbH5O50doOt3HnboT9Ih1a-zhbymAFUJfAJ7OnQhVNXeReCN80fQEEeTcmt7FEeTUngcjA1INMTYoYX9tZ4GZQ1vTLaeqOi1M7-D38DSNZvaw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Symbolic computation in discrete optimization: SCDO algorithm</title><source>Elsevier</source><source>Backfile Package - Mathematics (Legacy) [YMT]</source><creator>Cardillo, Juan ; Szigeti, Ferenc ; Hennet, Jean Claude ; Calvet, Jean Louis</creator><creatorcontrib>Cardillo, Juan ; Szigeti, Ferenc ; Hennet, Jean Claude ; Calvet, Jean Louis</creatorcontrib><description>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.</description><identifier>ISSN: 0362-546X</identifier><identifier>EISSN: 1873-5215</identifier><identifier>DOI: 10.1016/j.na.2005.03.056</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Boolean function ; Discrete optimization ; Symbolic computation</subject><ispartof>Nonlinear analysis, 2005-11, Vol.63 (5), p.e605-e615</ispartof><rights>2005 Elsevier Ltd</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323</citedby><cites>FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0362546X05003834$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,776,780,881,3551,27901,27902,45978</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00860390$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Cardillo, Juan</creatorcontrib><creatorcontrib>Szigeti, Ferenc</creatorcontrib><creatorcontrib>Hennet, Jean Claude</creatorcontrib><creatorcontrib>Calvet, Jean Louis</creatorcontrib><title>Symbolic computation in discrete optimization: SCDO algorithm</title><title>Nonlinear analysis</title><description>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.</description><subject>Boolean function</subject><subject>Discrete optimization</subject><subject>Symbolic computation</subject><issn>0362-546X</issn><issn>1873-5215</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp1kD1PwzAQhi0EEqWwM2ZlSDjbSZxWYqjKp1SpQzuwWRfboa6SuLJNpfLrSSliYzrpvfc56R5CbilkFGh5v816zBhAkQHPoCjPyIhWgqcFo8U5GQEvWVrk5fsluQphCwBU8HJEHlaHrnatVYly3e4zYrSuT2yfaBuUN9EkbhdtZ79-FtNkNX9cJth-OG_jprsmFw22wdz8zjFZPz-t56_pYvnyNp8tUsVZFdOmLqpKNTXTolR5XTMucshzRYViujCC5hMEJlAzpKyqJ03eUM40oqgYcsbH5O50doOt3HnboT9Ih1a-zhbymAFUJfAJ7OnQhVNXeReCN80fQEEeTcmt7FEeTUngcjA1INMTYoYX9tZ4GZQ1vTLaeqOi1M7-D38DSNZvaw</recordid><startdate>20051130</startdate><enddate>20051130</enddate><creator>Cardillo, Juan</creator><creator>Szigeti, Ferenc</creator><creator>Hennet, Jean Claude</creator><creator>Calvet, Jean Louis</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope></search><sort><creationdate>20051130</creationdate><title>Symbolic computation in discrete optimization: SCDO algorithm</title><author>Cardillo, Juan ; Szigeti, Ferenc ; Hennet, Jean Claude ; Calvet, Jean Louis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Boolean function</topic><topic>Discrete optimization</topic><topic>Symbolic computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cardillo, Juan</creatorcontrib><creatorcontrib>Szigeti, Ferenc</creatorcontrib><creatorcontrib>Hennet, Jean Claude</creatorcontrib><creatorcontrib>Calvet, Jean Louis</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Nonlinear analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cardillo, Juan</au><au>Szigeti, Ferenc</au><au>Hennet, Jean Claude</au><au>Calvet, Jean Louis</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Symbolic computation in discrete optimization: SCDO algorithm</atitle><jtitle>Nonlinear analysis</jtitle><date>2005-11-30</date><risdate>2005</risdate><volume>63</volume><issue>5</issue><spage>e605</spage><epage>e615</epage><pages>e605-e615</pages><issn>0362-546X</issn><eissn>1873-5215</eissn><abstract>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.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.na.2005.03.056</doi><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0362-546X
ispartof Nonlinear analysis, 2005-11, Vol.63 (5), p.e605-e615
issn 0362-546X
1873-5215
language eng
recordid cdi_hal_primary_oai_HAL_hal_00860390v1
source Elsevier; Backfile Package - Mathematics (Legacy) [YMT]
subjects Boolean function
Discrete optimization
Symbolic computation
title Symbolic computation in discrete optimization: SCDO algorithm
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T08%3A40%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Symbolic%20computation%20in%20discrete%20optimization:%20SCDO%20algorithm&rft.jtitle=Nonlinear%20analysis&rft.au=Cardillo,%20Juan&rft.date=2005-11-30&rft.volume=63&rft.issue=5&rft.spage=e605&rft.epage=e615&rft.pages=e605-e615&rft.issn=0362-546X&rft.eissn=1873-5215&rft_id=info:doi/10.1016/j.na.2005.03.056&rft_dat=%3Chal_cross%3Eoai_HAL_hal_00860390v1%3C/hal_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c328t-fb588cfb2d76c4bb2374044c17c2d5e7149a027ad2a128b9f4f132daa782a323%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true