Pages that link to "Item:Q6174810"
From MaRDI portal
The following pages link to On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810):
Displaying 5 items.
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- (Q5005186) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)