{"id":"https://openalex.org/W2585254943","doi":"https://doi.org/10.1007/978-3-319-53375-9_4","title":"Near-Boolean Optimization: A Continuous Approach to Set Packing and Partitioning","display_name":"Near-Boolean Optimization: A Continuous Approach to Set Packing and Partitioning","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2585254943","doi":"https://doi.org/10.1007/978-3-319-53375-9_4","mag":"2585254943"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53375-9_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53375-9_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101744986","display_name":"Giovanni Rossi","orcid":"https://orcid.org/0000-0001-5215-4325"},"institutions":[{"id":"https://openalex.org/I4210146975","display_name":"Zambon (Italy)","ror":"https://ror.org/04zzq8d03","country_code":"IT","type":"company","lineage":["https://openalex.org/I4210146975"]},{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giovanni Rossi","raw_affiliation_strings":["Department of Computer Science and Engineering - DISI, University of Bologna, via Mura Anteo Zamboni 7, 40126, Bologna, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering - DISI, University of Bologna, via Mura Anteo Zamboni 7, 40126, Bologna, Italy","institution_ids":["https://openalex.org/I9360294","https://openalex.org/I4210146975"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101744986"],"corresponding_institution_ids":["https://openalex.org/I4210146975","https://openalex.org/I9360294"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.068,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7331562,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"60","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6283684372901917},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6278709769248962},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.537363588809967},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.5018596649169922},{"id":"https://openalex.org/keywords/family-of-sets","display_name":"Family of sets","score":0.49971652030944824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4702647626399994},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46408578753471375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45684942603111267},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4465755522251129},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4353179335594177},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4310029149055481},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4278136193752289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.421700656414032},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41925594210624695}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6283684372901917},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6278709769248962},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.537363588809967},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.5018596649169922},{"id":"https://openalex.org/C150591576","wikidata":"https://www.wikidata.org/wiki/Q739925","display_name":"Family of sets","level":3,"score":0.49971652030944824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4702647626399994},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46408578753471375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45684942603111267},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4465755522251129},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4353179335594177},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4310029149055481},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4278136193752289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.421700656414032},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41925594210624695},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-53375-9_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53375-9_4","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W30680763","https://openalex.org/W143174683","https://openalex.org/W203529317","https://openalex.org/W583525811","https://openalex.org/W966413371","https://openalex.org/W1556690101","https://openalex.org/W1557310162","https://openalex.org/W1604279984","https://openalex.org/W1634954793","https://openalex.org/W1875347116","https://openalex.org/W1954834360","https://openalex.org/W1966923282","https://openalex.org/W1975794688","https://openalex.org/W2001663593","https://openalex.org/W2013469527","https://openalex.org/W2021873163","https://openalex.org/W2040661328","https://openalex.org/W2043260929","https://openalex.org/W2074078071","https://openalex.org/W2082885489","https://openalex.org/W2086297027","https://openalex.org/W2102900308","https://openalex.org/W2112755546","https://openalex.org/W2118886915","https://openalex.org/W2237052233","https://openalex.org/W2259808229","https://openalex.org/W2284302803","https://openalex.org/W2390070928","https://openalex.org/W2798658547","https://openalex.org/W2914659449","https://openalex.org/W2963031866","https://openalex.org/W3022321359","https://openalex.org/W3122951619","https://openalex.org/W3158732259","https://openalex.org/W4206483639","https://openalex.org/W4233363601","https://openalex.org/W4233568326","https://openalex.org/W4239954054","https://openalex.org/W4297399141","https://openalex.org/W4300302225","https://openalex.org/W4300337452"],"related_works":["https://openalex.org/W3108505487","https://openalex.org/W291089565","https://openalex.org/W1981394831","https://openalex.org/W1570244907","https://openalex.org/W1983878843","https://openalex.org/W2604120515","https://openalex.org/W2069301864","https://openalex.org/W1990620352","https://openalex.org/W2079957974","https://openalex.org/W1986173008"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}