Pages that link to "Item:Q2045008"
From MaRDI portal
The following pages link to Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008):
Displaying 9 items.
- Generating convex polynomial inequalities for mixed 0-1 programs (Q1810867) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q6589749) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
