The Binary Linearization Complexity of Pseudo-Boolean Functions

arXiv2301.06207MaRDI QIDQ6423449

No author found.

Publication date: 15 January 2023

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

This page was built for publication: The Binary Linearization Complexity of Pseudo-Boolean Functions