Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
In Mixed Integer Linear Programming (MIP), a (strong) backdoor is a "small" subset of an instance's integer variables with the following property: in a branch-and-bound procedure, the instance can be solved to global optimality by branching only on the variables in the backdoor. Constructing datasets of pre-computed backdoors for widely used MIP be...
Alternative Titles
Full title
Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2583229318
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2583229318
Other Identifiers
E-ISSN
2331-8422
DOI
10.48550/arxiv.2110.08423
