Pages that link to "Item:Q609569"
From MaRDI portal
The following pages link to An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569):
Displaying 10 items.
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- Lower bound improvement and forcing rule for quadratic binary programming (Q2506180) (← links)
