Rafael Lopez

Learn More
This paper is dedicated to a study of different extensions of the classical knapsack problem to the case when different elements of the problem formulation are subject to a degree of uncertainty described by random variables. This brings the knapsack problem into the realm of stochastic programming. Four different model formulations are proposed, based on(More)
In this paper, a detection strategy based on variable neighborhood search (VNS) and semidefinite relaxation of the CDMA maximum likelihood (ML) is investigated. The VNS method provides a good method for solving the ML problem while keeping the integer constraints. A SDP relaxation is used as an efficient way to generate an initial solution in a limited(More)
  • 1