A new metaheuristic and its application to the Steiner problems in graphs

Metaheuristics are a set of related ideas that provide a general framework to obtain the approximated solution of combinatorial optimization problems. We present ideas for a new method that we call SN. SN is based on the idea of dividing a given optimization problem into decision subproblems which a...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Urrutia, S., Loiseau, I.
Formato: JOUR
Materias:
Combinatorial optimization
Graph theory
Heuristic algorithms
Approximated solutions
Combinatorial optimization problems
ITS applications
Meta heuristics
Meta-heuristic approach
Metaheuristic
Optimization problems
Steiner problems
Optimization
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15224902_v2001-January_n_p273_Urrutia
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares