Srivastava, Vaibhav; Bullo, Francesco - In: European Journal of Operational Research 236 (2014) 2, pp. 488-498
We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized...
