Iterated local search algorithms for the Euclidean Steiner tree problem in "n" dimensions
Year of publication: |
November 2016
|
---|---|
Authors: | Forte, Vinícius Leal do ; Montenegro, Flávio Marcelo Tavares ; Brito, José André de Moura ; Maculan F., Nelson |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 23.2016, 6, p. 1185-1199
|
Subject: | Euclidean Steiner problem | ILS | metaheuristics | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | USA | United States | Theorie | Theory |
-
A critical analysis of the harmony search algorithm : how not to solve sudoku
Weyland, Dennis, (2015)
-
Lin, Jianhua, (2017)
-
Toward unification of exact and heuristic optimization methods
Hooker, J. N., (2015)
- More ...
-
A location-allocation model for logistics integration centers
Guimarães, Vanessa de Almeida, (2017)
-
Extended formulations for perfect domination problems and their algorithmic implications
Forte, Vinícius Leal do, (2023)
-
On deep disjunctive cutting planes for set partitioning : a computationally oriented research
Campello, Ruy Eduardo, (1984)
- More ...