loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Giovanni Rossi

Affiliation: University of Bologna, Italy

Keyword(s): Set Packing, Pseudo-Boolean Function, Polynomial Multilinear Extension, Local Search.

Related Ontology Subjects/Areas/Topics: Combinatorial Optimization ; Pattern Recognition ; Theory and Methods

Abstract: Given a family of feasible subsets of a ground set, the packing problem is to find a largest subfamily of pairwise disjoint family members. Non-approximability renders heuristics attractive viable options, while efficient methods with worst-case guarantee are a key concern in computational complexity. This work proposes a novel near-Boolean optimization method relying on a polynomial multilinear form with variables ranging each in a high-dimensional unit simplex. These variables are the elements of the ground set, and distribute each a unit membership over those feasible subsets where they are included. The given problem is thus translated into a continuous version where the objective is to maximize a function taking values on collections of points in a unit hypercube. Maximizers are shown to always include collections of hypercube disjoint vertices, i.e. partitions of the ground set, which constitute feasible solutions for the original discrete version of the problem. A gradient-bas ed local search in the expanded continuous domain is designed. Approximations with polynomials of bounded degree and near-Boolean coalition formation games are also finally discussed. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.191.216.163

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Rossi, G. (2016). Continuous Set Packing and Near-Boolean Functions. In Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods - ICPRAM; ISBN 978-989-758-173-1; ISSN 2184-4313, SciTePress, pages 84-96. DOI: 10.5220/0005697800840096

@conference{icpram16,
author={Giovanni Rossi.},
title={Continuous Set Packing and Near-Boolean Functions},
booktitle={Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods - ICPRAM},
year={2016},
pages={84-96},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005697800840096},
isbn={978-989-758-173-1},
issn={2184-4313},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods - ICPRAM
TI - Continuous Set Packing and Near-Boolean Functions
SN - 978-989-758-173-1
IS - 2184-4313
AU - Rossi, G.
PY - 2016
SP - 84
EP - 96
DO - 10.5220/0005697800840096
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic