Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions
We consider the problem of linearizing a pseudo-Boolean function f : { 0 , 1 } n → ℝ by means of k Boolean functions. Such a linearization yields an integer linear programming formulation with only k auxiliary variables. This motivates the definition of the linearization complexity of f as the minim...
Saved in:
| Published in: | Open Journal of Mathematical Optimization Vol. 5; pp. 1 - 12 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Université de Montpellier
10.10.2024
|
| Subjects: | |
| ISSN: | 2777-5860, 2777-5860 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!