On k-subset sum using enumerative encoding

    研究成果: Conference contribution

    7 被引用数 (Scopus)

    抄録

    Being a significant construct in a wide range of combinatorial problems, the k-subset sum problem (k-SSP) computes k-element subsets, out of an n-element set, satisfying a user-defined aggregation value. In this paper, we formulate the k-subset sum problem as a search (optimization) problem over the space of integers associated with combination elements. And by using rigorous computational experiments using the search space over more than 1014 integer numbers, we show that our approach is effective and efficient: it is feasible to find any combination with a user-defined sum within 104 function evaluations by using a gradient-free optimization algorithm. Our scheme opens the door to further advance the understanding of combinatorial problems by improved/tailored gradient-free optimization algorithms based on enumerative encoding. Also, our approach realizes the practical building block for combinatorial problems in planning and operations research using k-SSP concepts.

    本文言語English
    ホスト出版物のタイトル2016 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2016
    出版社Institute of Electrical and Electronics Engineers Inc.
    ページ81-86
    ページ数6
    ISBN(電子版)9781509058440
    DOI
    出版ステータスPublished - 2017 3 23
    イベント2016 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2016 - Limassol, Cyprus
    継続期間: 2016 12 122016 12 14

    Other

    Other2016 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2016
    CountryCyprus
    CityLimassol
    Period16/12/1216/12/14

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Computer Science Applications
    • Signal Processing

    フィンガープリント 「On k-subset sum using enumerative encoding」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル