No Cover Image

Conference Paper/Proceeding/Abstract 620 views

Projection Heuristics for Binary Branchings Between Sum and Product

Oliver Kullmann Orcid Logo, Oleg Zaikin

Theory and Applications of Satisfiability Testing – SAT 2021, Volume: 12831, Pages: 299 - 314

Swansea University Authors: Oliver Kullmann Orcid Logo, Oleg Zaikin

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1007/978-3-030-80223-3_21

Abstract

A general framework is developed for heuristics which choose between different branchings.

Published in: Theory and Applications of Satisfiability Testing – SAT 2021
ISBN: 9783030802226 9783030802233
ISSN: 0302-9743 1611-3349
Published: Cham Springer International Publishing 2021
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa58797
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2021-12-10T16:12:19Z
last_indexed 2023-01-11T14:39:38Z
id cronfa58797
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2022-07-25T11:41:04.8158299</datestamp><bib-version>v2</bib-version><id>58797</id><entry>2021-11-26</entry><title>Projection Heuristics for Binary Branchings Between Sum and Product</title><swanseaauthors><author><sid>2b410f26f9324d6b06c2b98f67362d05</sid><ORCID>0000-0003-3021-0095</ORCID><firstname>Oliver</firstname><surname>Kullmann</surname><name>Oliver Kullmann</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>8329c4277e15bac8c8e1b2efcae77354</sid><firstname>Oleg</firstname><surname>Zaikin</surname><name>Oleg Zaikin</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2021-11-26</date><deptcode>SCS</deptcode><abstract>A general framework is developed for heuristics which choose between different branchings.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>Theory and Applications of Satisfiability Testing &#x2013; SAT 2021</journal><volume>12831</volume><journalNumber/><paginationStart>299</paginationStart><paginationEnd>314</paginationEnd><publisher>Springer International Publishing</publisher><placeOfPublication>Cham</placeOfPublication><isbnPrint>9783030802226</isbnPrint><isbnElectronic>9783030802233</isbnElectronic><issnPrint>0302-9743</issnPrint><issnElectronic>1611-3349</issnElectronic><keywords/><publishedDay>2</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2021</publishedYear><publishedDate>2021-07-02</publishedDate><doi>10.1007/978-3-030-80223-3_21</doi><url/><notes/><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm>Not Required</apcterm><funders>EPSRC, EP/S015523/1</funders><projectreference>EP/S015523/1</projectreference><lastEdited>2022-07-25T11:41:04.8158299</lastEdited><Created>2021-11-26T14:10:00.0496779</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Oliver</firstname><surname>Kullmann</surname><orcid>0000-0003-3021-0095</orcid><order>1</order></author><author><firstname>Oleg</firstname><surname>Zaikin</surname><order>2</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2022-07-25T11:41:04.8158299 v2 58797 2021-11-26 Projection Heuristics for Binary Branchings Between Sum and Product 2b410f26f9324d6b06c2b98f67362d05 0000-0003-3021-0095 Oliver Kullmann Oliver Kullmann true false 8329c4277e15bac8c8e1b2efcae77354 Oleg Zaikin Oleg Zaikin true false 2021-11-26 SCS A general framework is developed for heuristics which choose between different branchings. Conference Paper/Proceeding/Abstract Theory and Applications of Satisfiability Testing – SAT 2021 12831 299 314 Springer International Publishing Cham 9783030802226 9783030802233 0302-9743 1611-3349 2 7 2021 2021-07-02 10.1007/978-3-030-80223-3_21 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University Not Required EPSRC, EP/S015523/1 EP/S015523/1 2022-07-25T11:41:04.8158299 2021-11-26T14:10:00.0496779 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Oliver Kullmann 0000-0003-3021-0095 1 Oleg Zaikin 2
title Projection Heuristics for Binary Branchings Between Sum and Product
spellingShingle Projection Heuristics for Binary Branchings Between Sum and Product
Oliver Kullmann
Oleg Zaikin
title_short Projection Heuristics for Binary Branchings Between Sum and Product
title_full Projection Heuristics for Binary Branchings Between Sum and Product
title_fullStr Projection Heuristics for Binary Branchings Between Sum and Product
title_full_unstemmed Projection Heuristics for Binary Branchings Between Sum and Product
title_sort Projection Heuristics for Binary Branchings Between Sum and Product
author_id_str_mv 2b410f26f9324d6b06c2b98f67362d05
8329c4277e15bac8c8e1b2efcae77354
author_id_fullname_str_mv 2b410f26f9324d6b06c2b98f67362d05_***_Oliver Kullmann
8329c4277e15bac8c8e1b2efcae77354_***_Oleg Zaikin
author Oliver Kullmann
Oleg Zaikin
author2 Oliver Kullmann
Oleg Zaikin
format Conference Paper/Proceeding/Abstract
container_title Theory and Applications of Satisfiability Testing – SAT 2021
container_volume 12831
container_start_page 299
publishDate 2021
institution Swansea University
isbn 9783030802226
9783030802233
issn 0302-9743
1611-3349
doi_str_mv 10.1007/978-3-030-80223-3_21
publisher Springer International Publishing
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description A general framework is developed for heuristics which choose between different branchings.
published_date 2021-07-02T04:15:37Z
_version_ 1763754049500348416
score 11.014067

Similar Items