Finding exact solutions for the Geometric Firefighter Problem in practice
•A new encompassing algorithm: preprocessing procedures, Integer Programming models.•Algorithms to generate high quality primal solutions and for instance size reduction.•A publicly available new set of challenging instances based on actual forest maps.•Openly accessible set of solutions to hundreds...
Uložené v:
| Vydané v: | Computers & operations research Ročník 97; s. 72 - 83 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Elsevier Ltd
01.09.2018
Pergamon Press Inc |
| Predmet: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •A new encompassing algorithm: preprocessing procedures, Integer Programming models.•Algorithms to generate high quality primal solutions and for instance size reduction.•A publicly available new set of challenging instances based on actual forest maps.•Openly accessible set of solutions to hundreds of instances with hundreds of barriers.•The NP-hard disjoint variant is shown to be easier in practice.
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 solution must take into account the speed of the circularly spreading fire and the barriers construction speed. A barrier is considered successfully constructed if the fire does not burn any still unconstructed point of the barrier. In this work, we consider the case where the initial set of barriers is comprised of rectilinear chords of the polygon. We present an Integer Programming (ip) model employed to solve the gfp to optimality along with procedures for preprocessing the instances, including primal algorithms and methods to reduce the problem size, as these constitute an essential step for solving harder instances. Moreover, we report on extensive experimental results that show that our ip model is an order of magnitude faster than the previous state-of-the art algorithm for the gfp. To further strain our algorithms, we introduce a new set of instances based on US national forests, which proved to be noticeably harder to solve than the previously available benchmark. An extended report on our experimental findings is presented along with a discussion that includes a restricted case where the constructed barriers must have pairwise disjoint interiors. |
|---|---|
| AbstractList | •A new encompassing algorithm: preprocessing procedures, Integer Programming models.•Algorithms to generate high quality primal solutions and for instance size reduction.•A publicly available new set of challenging instances based on actual forest maps.•Openly accessible set of solutions to hundreds of instances with hundreds of barriers.•The NP-hard disjoint variant is shown to be easier in practice.
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 solution must take into account the speed of the circularly spreading fire and the barriers construction speed. A barrier is considered successfully constructed if the fire does not burn any still unconstructed point of the barrier. In this work, we consider the case where the initial set of barriers is comprised of rectilinear chords of the polygon. We present an Integer Programming (ip) model employed to solve the gfp to optimality along with procedures for preprocessing the instances, including primal algorithms and methods to reduce the problem size, as these constitute an essential step for solving harder instances. Moreover, we report on extensive experimental results that show that our ip model is an order of magnitude faster than the previous state-of-the art algorithm for the gfp. To further strain our algorithms, we introduce a new set of instances based on US national forests, which proved to be noticeably harder to solve than the previously available benchmark. An extended report on our experimental findings is presented along with a discussion that includes a restricted case where the constructed barriers must have pairwise disjoint interiors. 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 solution must take into account the speed of the circularly spreading fire and the barriers construction speed. A barrier is considered successfully constructed if the fire does not burn any still unconstructed point of the barrier. In this work, we consider the case where the initial set of barriers is comprised of rectilinear chords of the polygon. We present an Integer Programming (ip) model employed to solve the gfp to optimality along with procedures for preprocessing the instances, including primal algorithms and methods to reduce the problem size, as these constitute an essential step for solving harder instances. Moreover, we report on extensive experimental results that show that our ip model is an order of magnitude faster than the previous state-of-the art algorithm for the gfp. To further strain our algorithms, we introduce a new set of instances based on US national forests, which proved to be noticeably harder to solve than the previously available benchmark. An extended report on our experimental findings is presented along with a discussion that includes a restricted case where the constructed barriers must have pairwise disjoint interiors. |
| Author | de Rezende, Pedro J. Zambon, Mauricio J.O. de Souza, Cid C. |
| Author_xml | – sequence: 1 givenname: Mauricio J.O. surname: Zambon fullname: Zambon, Mauricio J.O. email: mauricio.zambon@ic.unicamp.br – sequence: 2 givenname: Pedro J. orcidid: 0000-0002-9529-4253 surname: de Rezende fullname: de Rezende, Pedro J. email: rezende@ic.unicamp.br – sequence: 3 givenname: Cid C. orcidid: 0000-0002-5945-0845 surname: de Souza fullname: de Souza, Cid C. email: cid@ic.unicamp.br |
| BookMark | eNp9kMFKAzEQhoNUsFYfwFvA866TZNNk8STFVkHQg4K3kGanNaXd1CQVfXtT6slD5zKX-Wbm_87JoA89EnLFoGbAxjer2oVYc2C6BlkDiBMyZFqJSo3l-4AMQYCsQDb6jJyntIJSirMheZz6vvP9kuK3dZmmsN5lH_pEFyHS_IF0hmGDOXpHpz7iwi8_Mkb6EsN8jRvqe7qNBfQOL8jpwq4TXv71EXmb3r9OHqqn59nj5O6pckKqXDWacyaRjxeiAyfmwjnWCisBmpZ3LbZj10lrm845FKCl0FxZxhvgWjLRgBiR68PebQyfO0zZrMIu9uWk4aCV4roVqkypw5SLIaXyuHE-2320HK1fGwZm782sTPFm9t4MSFO8FZL9I7fRb2z8OcrcHhgswb88RpOcx95hV5y5bLrgj9C_TZGGrA |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2024_03_005 crossref_primary_10_1016_j_ejor_2018_10_037 crossref_primary_10_1016_j_ejor_2022_04_037 crossref_primary_10_1071_WF22037 crossref_primary_10_1007_s11464_022_1009_y |
| Cites_doi | 10.1016/j.dam.2012.08.005 10.1016/j.disc.2014.06.018 10.1007/s10878-012-9541-4 10.1137/0220055 10.1016/j.cor.2015.02.004 10.1109/TC.1979.1675432 10.1016/j.disc.2005.12.053 10.1016/j.dam.2007.06.002 10.1016/j.tcs.2010.11.046 10.1016/j.dam.2013.04.008 10.1016/j.disc.2014.06.020 10.1016/0925-7721(91)90012-4 10.1016/j.disc.2009.05.007 10.1016/j.asoc.2017.05.049 10.1016/j.tcs.2012.07.011 10.1016/j.tcs.2011.10.002 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier Ltd Copyright Pergamon Press Inc. Sep 2018 |
| Copyright_xml | – notice: 2018 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Sep 2018 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2018.05.003 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 83 |
| ExternalDocumentID | 10_1016_j_cor_2018_05_003 S0305054818301163 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AGCQF JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c357t-482215e26f3d0c3b3cc193a500492d9e96cd5aa4dcce30853827a124028513403 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000435062500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Wed Aug 13 03:44:52 EDT 2025 Tue Nov 18 22:06:16 EST 2025 Sat Nov 29 07:24:09 EST 2025 Fri Feb 23 02:49:01 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Geometric Firefighter Problem Combinatorial Optimization Computational Geometry Integer Programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c357t-482215e26f3d0c3b3cc193a500492d9e96cd5aa4dcce30853827a124028513403 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-5945-0845 0000-0002-9529-4253 |
| PQID | 2087728937 |
| PQPubID | 45870 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_2087728937 crossref_citationtrail_10_1016_j_cor_2018_05_003 crossref_primary_10_1016_j_cor_2018_05_003 elsevier_sciencedirect_doi_10_1016_j_cor_2018_05_003 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-09-01 |
| PublicationDateYYYYMMDD | 2018-09-01 |
| PublicationDate_xml | – month: 09 year: 2018 text: 2018-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2018 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | García-Martínez, Blum, Rodríguez, Lozano (bib0009) 2015; 60 Seidel (bib0025) 1991; 1 de Rezende, P. J., de Souza, C. C., Couto, M. C., Tozoni, D. C., 2009. Instances for the art gallery problem. Michalak (bib0021) 2017; 59 Kong, Zhang, Wang (bib0018) 2014; 334 Michalak (bib0022) 2017; 10197 United States Forest Service, 2015. The rising cost of wildfire operations: effects on the forest service’s non-fire work. Michalak, Knowles (bib0023) 2016 United States Department of Agriculture, 2017. Administrative forest boundaries. Wang, Finbow, Wang (bib0029) 2014; 27 Wang, Yue, Zhu (bib0031) 2011; 412 [Online; accessed 10-January-2018]. Bungiu, F., Hemmer, M., Hershberger, J. Huang, K., Kröller A., 2014. Efficient computation of visibility polygons.CoRR. arXiv Blum, Blesa, García-Martínez, Rodríguez, Lozano (bib0002) 2014; 8600 Zambon, de Rezende, de Souza (bib0032) 2016 Klein, Levcopoulos, Lingas (bib0016) 2014; 8392 Wang, Kong, Zhang (bib0030) 2012; 457 [Online; accessed 15-April-2016]. Klein, Langetepe, Levcopoulos (bib0015) 2015; 34 Lipinski (bib0019) 2017 [Online; accessed 11-May-2017]. Wang, Moeller (bib0028) 2002; 41 Develin, Hartke (bib0006) 2007; 155 Finbow, King, MacGillivray, Rizzi (bib0008) 2007; 307 King, MacGillivray (bib0014) 2010; 310 Feldheim, Hod (bib0007) 2013; 161 Kong, Wang, Zhu (bib0017) 2012; 416 Michalak (bib0020) 2014; 8669 Costa, Dantas, Dourado, Penso, Rautenbach (bib0005) 2013; 161 Hartnell (bib0012) 1995 [Online; accessed 17-March-2017]. Gavenčiak, Kratochvíl, Prałat (bib0010) 2014; 337 Zambon, M. J. O., de Rezende, P. J., de Souza, C. C., 2018. The geometric firefighter problem project. Cai, Wang (bib0004) 2009; 23 Ghosh, Mount (bib0011) 1991; 20 Hu, Windbichler, Raidl (bib0013) 2015; 9026 Bentley, Ottmann (bib0001) 1979; C-28 Bentley (10.1016/j.cor.2018.05.003_bib0001) 1979; C-28 Michalak (10.1016/j.cor.2018.05.003_bib0021) 2017; 59 Michalak (10.1016/j.cor.2018.05.003_bib0020) 2014; 8669 Klein (10.1016/j.cor.2018.05.003_sbref0015) 2015; 34 Finbow (10.1016/j.cor.2018.05.003_bib0008) 2007; 307 Gavenčiak (10.1016/j.cor.2018.05.003_bib0010) 2014; 337 Feldheim (10.1016/j.cor.2018.05.003_bib0007) 2013; 161 Lipinski (10.1016/j.cor.2018.05.003_bib0019) 2017 Michalak (10.1016/j.cor.2018.05.003_bib0023) 2016 García-Martínez (10.1016/j.cor.2018.05.003_bib0009) 2015; 60 Michalak (10.1016/j.cor.2018.05.003_bib0022) 2017; 10197 Develin (10.1016/j.cor.2018.05.003_bib0006) 2007; 155 Ghosh (10.1016/j.cor.2018.05.003_bib0011) 1991; 20 Hu (10.1016/j.cor.2018.05.003_bib0013) 2015; 9026 10.1016/j.cor.2018.05.003_bib0033 Wang (10.1016/j.cor.2018.05.003_bib0028) 2002; 41 Blum (10.1016/j.cor.2018.05.003_sbref0002) 2014; 8600 King (10.1016/j.cor.2018.05.003_bib0014) 2010; 310 Kong (10.1016/j.cor.2018.05.003_bib0017) 2012; 416 Wang (10.1016/j.cor.2018.05.003_bib0031) 2011; 412 Zambon (10.1016/j.cor.2018.05.003_bib0032) 2016 10.1016/j.cor.2018.05.003_bib0024 10.1016/j.cor.2018.05.003_bib0003 Seidel (10.1016/j.cor.2018.05.003_bib0025) 1991; 1 10.1016/j.cor.2018.05.003_bib0026 10.1016/j.cor.2018.05.003_bib0027 Klein (10.1016/j.cor.2018.05.003_bib0016) 2014; 8392 Wang (10.1016/j.cor.2018.05.003_bib0029) 2014; 27 Wang (10.1016/j.cor.2018.05.003_bib0030) 2012; 457 Costa (10.1016/j.cor.2018.05.003_bib0005) 2013; 161 Kong (10.1016/j.cor.2018.05.003_bib0018) 2014; 334 Hartnell (10.1016/j.cor.2018.05.003_sbref0012) 1995 Cai (10.1016/j.cor.2018.05.003_bib0004) 2009; 23 |
| References_xml | – reference: United States Forest Service, 2015. The rising cost of wildfire operations: effects on the forest service’s non-fire work. – volume: 41 start-page: 19 year: 2002 end-page: 34 ident: bib0028 article-title: Fire control on graphs publication-title: J. Comb. Math.Comb. Comput. – volume: 161 start-page: 2410 year: 2013 end-page: 2419 ident: bib0005 article-title: More fires and more fighters publication-title: Discrete Appl. Math. – volume: 307 start-page: 2094 year: 2007 end-page: 2105 ident: bib0008 article-title: The firefighter problem for graphs of maximum degree three publication-title: Discrete Math. – volume: 310 start-page: 614 year: 2010 end-page: 621 ident: bib0014 article-title: The firefighter problem for cubic graphs publication-title: Discrete Math. – volume: 27 start-page: 621 year: 2014 end-page: 642 ident: bib0029 article-title: A lower bound of the surviving rate of a planar graph with girth at least seven publication-title: J. Comb. Optim. – volume: 20 start-page: 888 year: 1991 end-page: 910 ident: bib0011 article-title: An output-sensitive algorithm for computing visibility graphs publication-title: SIAM J. Comput. – start-page: 2161 year: 2017 end-page: 2168 ident: bib0019 article-title: Solving the firefighter problem with two elements using a multi-modal estimation of distribution algorithm publication-title: 2017 IEEE Congress on Evolutionary Computation, CEC 2017 – reference: United States Department of Agriculture, 2017. Administrative forest boundaries. – year: 1995 ident: bib0012 article-title: Firefighter! An application of domination publication-title: 25th Manitoba Conference on Combinatorial Mathematics and Computing – volume: 457 start-page: 158 year: 2012 end-page: 165 ident: bib0030 article-title: The 2-surviving rate of planar graphs without 4-cycles publication-title: Theor. Comput. Sci. – volume: 412 start-page: 913 year: 2011 end-page: 921 ident: bib0031 article-title: The surviving rate of an outerplanar graph for the firefighter problem publication-title: Theor. Comput. Sci. – volume: 334 start-page: 13 year: 2014 end-page: 19 ident: bib0018 article-title: The surviving rate of digraphs publication-title: Discrete Math. – reference: , [Online; accessed 11-May-2017]. – volume: 8600 start-page: 218 year: 2014 end-page: 229 ident: bib0002 article-title: The firefighter problem: application of hybrid ant colony optimization algorithms publication-title: Evolutionary Computation in Combinatorial Optimisation - 14th European Conference, EvoCOP 2014 – volume: 155 start-page: 2257 year: 2007 end-page: 2268 ident: bib0006 article-title: Fire containment in grids of dimension three and higher publication-title: Discrete Appl. Math. – start-page: 223 year: 2016 end-page: 229 ident: bib0032 article-title: Exact solutions for the geometric firefighter problem publication-title: 28th Canadian Conference on Computational Geometry, CCCG, Proceedings – reference: Bungiu, F., Hemmer, M., Hershberger, J. Huang, K., Kröller A., 2014. Efficient computation of visibility polygons.CoRR. arXiv: – volume: 161 start-page: 301 year: 2013 end-page: 306 ident: bib0007 article-title: 3/2 Firefighters are not enough publication-title: Discrete Appl. Math. – volume: 416 start-page: 65 year: 2012 end-page: 70 ident: bib0017 article-title: The surviving rate of planar graphs publication-title: Theor. Comput. Sci. – reference: de Rezende, P. J., de Souza, C. C., Couto, M. C., Tozoni, D. C., 2009. Instances for the art gallery problem. – reference: , [Online; accessed 17-March-2017]. – volume: 8392 start-page: 261 year: 2014 end-page: 272 ident: bib0016 article-title: Approximation algorithms for the geometric firefighter and budget fence problems publication-title: LATIN – volume: 337 start-page: 142 year: 2014 end-page: 155 ident: bib0010 article-title: Firefighting on square, hexagonal, and triangular grids publication-title: Discrete Math. – reference: , [Online; accessed 15-April-2016]. – volume: 1 start-page: 51 year: 1991 end-page: 64 ident: bib0025 article-title: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons publication-title: Comput. Geom. – volume: 10197 start-page: 108 year: 2017 end-page: 123 ident: bib0022 article-title: Estimation of distribution algorithms for the firefighter problem publication-title: Evolutionary Computation in Combinatorial Optimization - 17th European Conference, EvoCOP 2017, Proceedings – volume: C-28 start-page: 643 year: 1979 end-page: 647 ident: bib0001 article-title: Algorithms for reporting and counting geometric intersections publication-title: IEEE Trans. Comput. – volume: 23 start-page: 1814 year: 2009 end-page: 1826 ident: bib0004 article-title: The surviving rate of a graph for the firefighter problem publication-title: SIAM J. Discrete Math. – volume: 34 start-page: 768 year: 2015 end-page: 780 ident: bib0015 article-title: A fire fighter’s problem publication-title: 31st International Symposium on Computational Geometry, Proceedings – volume: 59 start-page: 389 year: 2017 end-page: 404 ident: bib0021 article-title: ED-LS - a heuristic local search for the multiobjective firefighter problem publication-title: Appl. Soft. Comput. – reference: Zambon, M. J. O., de Rezende, P. J., de Souza, C. C., 2018. The geometric firefighter problem project. – start-page: 248 year: 2016 end-page: 265 ident: bib0023 article-title: Simheuristics for the multiobjective nondeterministic firefighter problem in a time-constrained setting publication-title: Applications of Evolutionary Computation - 19th European Conference, EvoApplications 2016, Proceedings, Part II – volume: 8669 start-page: 484 year: 2014 end-page: 491 ident: bib0020 article-title: Auto-adaptation of genetic operators for multi-objective optimization in the firefighter problem publication-title: Intelligent Data Engineering and Automated Learning - IDEAL 2014 - 15th International Conference, Proceedings – volume: 9026 start-page: 25 year: 2015 end-page: 35 ident: bib0013 article-title: A new solution representation for the firefighter problem publication-title: Evolutionary Computation in Combinatorial Optimization - 15th European Conference, EvoCOP 2015, Proceedings – reference: , [Online; accessed 10-January-2018]. – volume: 60 start-page: 55 year: 2015 end-page: 66 ident: bib0009 article-title: The firefighter problem: empirical results on random graphs publication-title: Comput. OR – ident: 10.1016/j.cor.2018.05.003_bib0033 – volume: 8669 start-page: 484 year: 2014 ident: 10.1016/j.cor.2018.05.003_bib0020 article-title: Auto-adaptation of genetic operators for multi-objective optimization in the firefighter problem – volume: 161 start-page: 301 issue: 1–2 year: 2013 ident: 10.1016/j.cor.2018.05.003_bib0007 article-title: 3/2 Firefighters are not enough publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2012.08.005 – volume: 334 start-page: 13 year: 2014 ident: 10.1016/j.cor.2018.05.003_bib0018 article-title: The surviving rate of digraphs publication-title: Discrete Math. doi: 10.1016/j.disc.2014.06.018 – ident: 10.1016/j.cor.2018.05.003_bib0027 – volume: 34 start-page: 768 year: 2015 ident: 10.1016/j.cor.2018.05.003_sbref0015 article-title: A fire fighter’s problem – volume: 27 start-page: 621 issue: 4 year: 2014 ident: 10.1016/j.cor.2018.05.003_bib0029 article-title: A lower bound of the surviving rate of a planar graph with girth at least seven publication-title: J. Comb. Optim. doi: 10.1007/s10878-012-9541-4 – volume: 20 start-page: 888 issue: 5 year: 1991 ident: 10.1016/j.cor.2018.05.003_bib0011 article-title: An output-sensitive algorithm for computing visibility graphs publication-title: SIAM J. Comput. doi: 10.1137/0220055 – volume: 10197 start-page: 108 year: 2017 ident: 10.1016/j.cor.2018.05.003_bib0022 article-title: Estimation of distribution algorithms for the firefighter problem – volume: 60 start-page: 55 year: 2015 ident: 10.1016/j.cor.2018.05.003_bib0009 article-title: The firefighter problem: empirical results on random graphs publication-title: Comput. OR doi: 10.1016/j.cor.2015.02.004 – volume: C-28 start-page: 643 issue: 9 year: 1979 ident: 10.1016/j.cor.2018.05.003_bib0001 article-title: Algorithms for reporting and counting geometric intersections publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1979.1675432 – start-page: 248 year: 2016 ident: 10.1016/j.cor.2018.05.003_bib0023 article-title: Simheuristics for the multiobjective nondeterministic firefighter problem in a time-constrained setting – volume: 9026 start-page: 25 year: 2015 ident: 10.1016/j.cor.2018.05.003_bib0013 article-title: A new solution representation for the firefighter problem – volume: 307 start-page: 2094 issue: 16 year: 2007 ident: 10.1016/j.cor.2018.05.003_bib0008 article-title: The firefighter problem for graphs of maximum degree three publication-title: Discrete Math. doi: 10.1016/j.disc.2005.12.053 – volume: 155 start-page: 2257 issue: 17 year: 2007 ident: 10.1016/j.cor.2018.05.003_bib0006 article-title: Fire containment in grids of dimension three and higher publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2007.06.002 – start-page: 223 year: 2016 ident: 10.1016/j.cor.2018.05.003_bib0032 article-title: Exact solutions for the geometric firefighter problem – volume: 412 start-page: 913 issue: 8–10 year: 2011 ident: 10.1016/j.cor.2018.05.003_bib0031 article-title: The surviving rate of an outerplanar graph for the firefighter problem publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.11.046 – volume: 8600 start-page: 218 year: 2014 ident: 10.1016/j.cor.2018.05.003_sbref0002 article-title: The firefighter problem: application of hybrid ant colony optimization algorithms – ident: 10.1016/j.cor.2018.05.003_bib0026 – ident: 10.1016/j.cor.2018.05.003_bib0024 – volume: 8392 start-page: 261 year: 2014 ident: 10.1016/j.cor.2018.05.003_bib0016 article-title: Approximation algorithms for the geometric firefighter and budget fence problems – ident: 10.1016/j.cor.2018.05.003_bib0003 – volume: 41 start-page: 19 year: 2002 ident: 10.1016/j.cor.2018.05.003_bib0028 article-title: Fire control on graphs publication-title: J. Comb. Math.Comb. Comput. – volume: 161 start-page: 2410 issue: 16–17 year: 2013 ident: 10.1016/j.cor.2018.05.003_bib0005 article-title: More fires and more fighters publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2013.04.008 – volume: 337 start-page: 142 year: 2014 ident: 10.1016/j.cor.2018.05.003_bib0010 article-title: Firefighting on square, hexagonal, and triangular grids publication-title: Discrete Math. doi: 10.1016/j.disc.2014.06.020 – volume: 23 start-page: 1814 issue: 4 year: 2009 ident: 10.1016/j.cor.2018.05.003_bib0004 article-title: The surviving rate of a graph for the firefighter problem publication-title: SIAM J. Discrete Math. – volume: 1 start-page: 51 year: 1991 ident: 10.1016/j.cor.2018.05.003_bib0025 article-title: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons publication-title: Comput. Geom. doi: 10.1016/0925-7721(91)90012-4 – volume: 310 start-page: 614 issue: 3 year: 2010 ident: 10.1016/j.cor.2018.05.003_bib0014 article-title: The firefighter problem for cubic graphs publication-title: Discrete Math. doi: 10.1016/j.disc.2009.05.007 – volume: 59 start-page: 389 year: 2017 ident: 10.1016/j.cor.2018.05.003_bib0021 article-title: ED-LS - a heuristic local search for the multiobjective firefighter problem publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2017.05.049 – volume: 457 start-page: 158 year: 2012 ident: 10.1016/j.cor.2018.05.003_bib0030 article-title: The 2-surviving rate of planar graphs without 4-cycles publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2012.07.011 – volume: 416 start-page: 65 year: 2012 ident: 10.1016/j.cor.2018.05.003_bib0017 article-title: The surviving rate of planar graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2011.10.002 – year: 1995 ident: 10.1016/j.cor.2018.05.003_sbref0012 article-title: Firefighter! An application of domination – start-page: 2161 year: 2017 ident: 10.1016/j.cor.2018.05.003_bib0019 article-title: Solving the firefighter problem with two elements using a multi-modal estimation of distribution algorithm |
| SSID | ssj0000721 |
| Score | 2.2774725 |
| Snippet | •A new encompassing algorithm: preprocessing procedures, Integer Programming models.•Algorithms to generate high quality primal solutions and for instance size... 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... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 72 |
| SubjectTerms | Algorithms Barriers Chords (geometry) Combinatorial Optimization Computational Geometry Firefighters Geometric Firefighter Problem Integer Programming Operations research Set theory Studies |
| Title | Finding exact solutions for the Geometric Firefighter Problem in practice |
| URI | https://dx.doi.org/10.1016/j.cor.2018.05.003 https://www.proquest.com/docview/2087728937 |
| Volume | 97 |
| WOSCitedRecordID | wos000435062500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pa9swFBajHWM77Ee2sW7d0GGnBQfbkiz5WEKztYdusA7CLsaSFXBZ7eCkJfSv75MsKSasZT3sYoIVKyLv09Nn6XvvIfRZiJIyLnWk05xGVCoNc47nEZNSZEpTymVsi03wszMxn-c_nHRoZcsJ8KYRm02-_K-mhntgbBM6-wBzh07hBnwGo8MVzA7XfzL8rO4DVfTGhD-G3wp6wq-6vTRltNR4Bu5uYV7OdWcCBkxhGSsqd4FTQ97qiz-sLFTape6chM4lCwqbyr_LS-kE-TZhUd2OTyffJ765MmUibsy2ey8OrjrTPmj92V7dWD47ravxdDLclEhEUF2FYCyjCWR9Ek3vaHshrvOUfcEev-aSv3rzfmPhAoxhMrcmwuZYjcl26fLH9TsrWtAZegnbRQFdFKaLImaFzQ67n3KWgxvcPzo5np9uF29uQ_XC-P1BuJUE7ozjLiqzs6hbpnL-Ej13rxj4qIfGK_RINyP0xEc4jNALb0zsHPsIPRukpXyNThyEsIUQDhDCACEMEMIBQngAIewghOsGewi9Qb9mx-fTb5EruREpwvg6osAXE6bTbEGqWBFJlAKGb6pm0Dytcp1nqmJlSSulNAG2TkTKy8Sc0AFzJzQmb9Fe0zb6HcJkwcyhL_BlWlKREKnlIssroaEnqZLsAMX-3yuUy0dvyqL8Ke602gH6Eh5Z9slY7vsy9SYpHJvsWWIB8LrvsUNvvsLN6hW0gwNLDbV__5AhfEBPt5PjEO2tuyv9ET1W1-t61X1y0LsFFsucwQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finding+exact+solutions+for+the+Geometric+Firefighter+Problem+in+practice&rft.jtitle=Computers+%26+operations+research&rft.au=Zambon%2C+Mauricio+J.O.&rft.au=de+Rezende%2C+Pedro+J.&rft.au=de+Souza%2C+Cid+C.&rft.date=2018-09-01&rft.issn=0305-0548&rft.volume=97&rft.spage=72&rft.epage=83&rft_id=info:doi/10.1016%2Fj.cor.2018.05.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2018_05_003 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |