Listar por tema "EAGH"
Mostrando ítems 1-1 de 1
Empirically Adjusted Greedy Algoriths (EAGH): A new approach to solving combinatorial optimisation problems (2005-10)
Report de recerca
Acceso abiertoA greedy heuristics to solve a given combinatorial optimisation problem can be seen as an element of an infinite set of heuristics, H, which is defined by a function that depends on several parameters. We propose a procedure ...