Pages that link to "Item:Q346478"

The following pages link to An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478):

Displaying 1 item.

• Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data (Q2032031) (← links)