( en | de | ru )

 

Disambiguation of "Reyes, Laura Cruz"

Author of the publication

copydeleteadd this publication to your clipboard
Survey of polynomial transformations between NP-complete problems.

, , , , , , , and . J. Comput. Appl. Math., 235 (16): 4851-4865 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mario Laura

Marco Laurati

Eliseo Cruz Vergara

Alvaro Cruz-Saco

Reynaldo Cruz-Rivera

 

Other publications of authors with the same name

Adaptive Allocation of Data-Objects in the Web Using Neural Networks., , , , and . AI*IA, volume 2829 of Lecture Notes in Computer Science, page 154-164. Springer, (2003)Evolving and reusing Bin Packing heuristic through Grammatical Differential Evolution., , , , , and . NaBIC, page 92-98. IEEE, (2013)Decomposition Based on Models that use Bandwidth Minimization Heuristics in Matrices for Scheduling Problems., , , , , and . Int. J. Comb. Optim. Probl. Informatics, 8 (3): 59-63 (2017)A framework for informing consumers on the ecological impact of products at point of sale., , , , , and . Behav. Inf. Technol., 37 (6): 607-621 (2018)Design and Solution of a Surrogate Model for Portfolio Optimization Based on Project Ranking., , , , and . Sci. Program., (2017)Preference Incorporation into Many-Objective Optimization: An Outranking-based Ant Colony Algorithm., , , , , and . CoRR, (2021)Uncertainty Modelling for Project Portfolio Problem using Interval Analysis., , , , , and . Int. J. Comb. Optim. Probl. Informatics, 7 (3): 20-27 (2016)An Ant Colony System Metaheuristic Algorithm for Solving a Bi-Objective Purchasing Scheduling Problem., , , , , , and . Res. Comput. Sci., (2014)Analysis of Speech Acts for the Design of a Corpus of Phrases used in an Intelligent Learning Environment., , , , , and . Res. Comput. Sci., 148 (5): 33-41 (2019)Editorial., , and . Polibits, (2020)