Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Mauricio J. O. Zambon"'
Publikováno v:
European Journal of Operational Research. 274:1090-1101
In this paper, we introduce the Geometric Firefighter Routing Problem ( gfrp ) as a variant of the Geometric Firefighter Problem aiming to better model more realistic situations. We design an exact algorithm based on a core Linear Integer Programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::844fbd79edd091066567c530eea89285
https://doi.org/10.1016/j.ejor.2018.10.037
https://doi.org/10.1016/j.ejor.2018.10.037
Publikováno v:
Computers & Operations Research. 97:72-83
In the Geometric Firefighter Problem ( gfp ), one aims to maximize the total area shielded from a fire that radiates from a point inside a polygonal region, by constructing a subset of a given set of barriers. To decide which barriers to construct, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fa95a431934ce91e3eda468848dfe4b
https://doi.org/10.1016/j.cor.2018.05.003
https://doi.org/10.1016/j.cor.2018.05.003
Publikováno v:
Experimental Algorithms ISBN: 9783319079585
SEA
SEA
Recently introduced in [1], the Chromatic Art Gallery Problem (CAGP) is related to the well known Art Gallery Problem to the extent that given a polygon P, a set of guards within P that satisfies a particular property is sought. Define a proper color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db243e84984d93c5def0cd21820f6cb5
https://doi.org/10.1007/978-3-319-07959-2_6
https://doi.org/10.1007/978-3-319-07959-2_6
