Patents by Inventor Rafael Martí

Rafael Martí has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Maximizing diversity in a subset of elements utilizing GRASP with path relinking
    Patent number: 8185655
    Abstract: Methods, systems, and computer-readable media for maximizing diversity in a subset of elements selected from a set of elements are provided. An algorithm that combines the GRASP and path relinking heuristics is utilized to find an approximate solution to a max-min diversity problem modeled from the set of elements. The GRASP heuristic is applied to the set of elements for a number of iterations to generate a set of feasible solutions, and a best solution is determined from the set. The path relinking heuristic is then applied between a pair of solutions in the set of feasible solutions to generate a candidate solution. If the candidate solution is better than the best solution, then the best solution is replaced with the candidate solution, and the process is repeated until the path relinking heuristic has been applied between each pair of solutions in the set of feasible solutions.
    Type: Grant
    Filed: December 3, 2008
    Date of Patent: May 22, 2012
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Mauricio Guilherme de Carvalho Resende, Abraham Duarte, Micael Gallego, Rafael Martí
  • Maximizing Diversity in a Subset of Elements Utilizing GRASP With Path Relinking
    Publication number: 20100138373
    Abstract: Methods, systems, and computer-readable media for maximizing diversity in a subset of elements selected from a set of elements are provided. An algorithm that combines the GRASP and path relinking heuristics is utilized to find an approximate solution to a max-min diversity problem modeled from the set of elements. The GRASP heuristic is applied to the set of elements for a number of iterations to generate a set of feasible solutions, and a best solution is determined from the set. The path relinking heuristic is then applied between a pair of solutions in the set of feasible solutions to generate a candidate solution. If the candidate solution is better than the best solution, then the best solution is replaced with the candidate solution, and the process is repeated until the path relinking heuristic has been applied between each pair of solutions in the set of feasible solutions.
    Type: Application
    Filed: December 3, 2008
    Publication date: June 3, 2010
    Inventors: Mauricio Guilherme de Carvalho Resende, Abraham Duarte, Micael Gallego, Rafael Marti