A Aralex Aachen research explorer

December 22, 2014 article

A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields

IEEE Transactions on Pattern Analysis and Machine Intelligence

DOI: 10.1109/tpami.2014.2382109 OpenAlex

Authors 0

Author list not loaded yet.

Cited by 4 stored of 14

Quadratization and convexification in polynomial binary optimization
2025 Journal of Combinatorial Optimization article Mathematics Advanced Optimization Algorithms Research Open access

5

citations
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences
2024 Computers & Operations Research article Mathematics Advanced Optimization Algorithms Research Open access

4

citations
Solving Unconstrained Binary Polynomial Programs with Limited Reach
2023 SSRN Electronic Journal preprint Mathematics Advanced Optimization Algorithms Research Open access

0

citations
Persistency of Linear Programming Relaxations for the Stable Set Problem
2020 Lecture notes in computer science conference-paper Computer Science Complexity and Algorithms in Graphs Open access

2

citations

4 results

References 0