scientific article
From MaRDI portal
Publication:2816363
zbMath1362.68278MaRDI QIDQ2816363
Antonio L. Bajuelos, Mafalda Martins, Santiago Canales, Gregorio Hernández
Publication date: 8 July 2016
Full work available at URL: http://www.jucs.org/jucs_18_14/a_hybrid_metaheuristic_strategy
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational geometryapproximation algorithmsart gallery problemshybrid metaheuristicscoverage problemsvisibility problems
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (3)
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon ⋮ A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon ⋮ Computing the \(k\)-visibility region of a point in a polygon
This page was built for publication:
