Pages that link to "Item:Q3544267"
From MaRDI portal
The following pages link to Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267):
Displaying 22 items.
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← links)
- On the product knapsack problem (Q1653266) (← links)
- On decomposability of multilinear sets (Q1659675) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization (Q4012442) (← links)
- A polynomial case of unconstrained zero-one quadratic optimization (Q5955560) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← 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)
