Pages that link to "Item:Q2810549"
From MaRDI portal
The following pages link to On the complexity of local search in unconstrained quadratic binary optimization (Q2810549):
Displaying 5 items.
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)