Login / Signup
)=y is solvable.
Dragana S. Cvetkovic-Ilic
Published in:
Appl. Math. Lett. (2008)
Keyphrases
</>
special case
np complete
np hard
computational complexity
optimal solution
objective function
convex sets