Solving the geometric firefighter routing problem via integer programming
•New GFP variants that allow for more general sets of barriers and solutions.•Problems solved to optimality through Integer Programming modeling.•Preprocessing algorithms and IP-based primal heuristics described in detail.•Two large publicly available sets of challenging instances based on actual fo...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 274; číslo 3; s. 1090 - 1101 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.05.2019
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •New GFP variants that allow for more general sets of barriers and solutions.•Problems solved to optimality through Integer Programming modeling.•Preprocessing algorithms and IP-based primal heuristics described in detail.•Two large publicly available sets of challenging instances based on actual forests.•Openly accessible best known bounds and solutions for more than a thousand instances.
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 formulation and propose additional sets of valid constraints to strengthen it. The algorithm also includes primal heuristics, and preprocessing procedures to reduce the model size. Besides, we generate two large sets of instances, tailored to the gfrp, and report on comprehensive experimental results for them. Thorough analysis validate the effectiveness of each major step of the algorithm and the overall performance of our approach. |
|---|---|
| AbstractList | •New GFP variants that allow for more general sets of barriers and solutions.•Problems solved to optimality through Integer Programming modeling.•Preprocessing algorithms and IP-based primal heuristics described in detail.•Two large publicly available sets of challenging instances based on actual forests.•Openly accessible best known bounds and solutions for more than a thousand instances.
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 formulation and propose additional sets of valid constraints to strengthen it. The algorithm also includes primal heuristics, and preprocessing procedures to reduce the model size. Besides, we generate two large sets of instances, tailored to the gfrp, and report on comprehensive experimental results for them. Thorough analysis validate the effectiveness of each major step of the algorithm and the overall performance of our approach. |
| Author | J. de Rezende, Pedro O. Zambon, Mauricio J. C. de Souza, Cid |
| Author_xml | – sequence: 1 givenname: Mauricio J. surname: O. Zambon fullname: O. Zambon, Mauricio J. email: mauricio.zambon@ic.unicamp.br – sequence: 2 givenname: Pedro surname: J. de Rezende fullname: J. de Rezende, Pedro email: rezende@ic.unicamp.br – sequence: 3 givenname: Cid orcidid: 0000-0002-5945-0845 surname: C. de Souza fullname: C. de Souza, Cid email: cid@ic.unicamp.br |
| BookMark | eNp9kF1LwzAUQINMcJv-AZ_6B1qTtEkz8EWGH4OBD-pzSLPb7pa2GWks-O9NmU8-7Clwbk7IPSuyGNwAhNwzmjHK5EObQet8xilTEWQ0L6_IkqmSp1JJuiDLSMqUc1bekNU4tpRSJphYkt2H6yYcmiQcIWnA9RA82qRGDzU2xwA-8e47zDdO3lUd9MmEJsEhQBNnkTXe9H2c35Lr2nQj3P2da_L18vy5fUv376-77dM-tbkUIc1B1FJWZW4LWRmgtbWiUCXwvKBKCSEKqKBmErilYiMPRWEsKK7kRoGMJF8TdX7XejeO8ZvaYjAB3RC8wU4zquckutVzEj0nmVkMEFX-Tz157I3_uSw9niWIS00IXo8WYbBwiI1s0AeHl_RfCh5-Jw |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2024_03_005 crossref_primary_10_3390_math11010179 crossref_primary_10_1007_s11464_022_1009_y crossref_primary_10_1016_j_comgeo_2021_101794 |
| Cites_doi | 10.1016/j.dam.2013.04.008 10.1016/j.asoc.2017.05.049 10.1016/j.disc.2009.05.007 10.1016/j.disc.2014.06.018 10.1016/0925-7721(91)90012-4 10.1016/j.disc.2005.12.053 10.1016/j.tcs.2012.07.011 10.1016/j.disc.2014.06.020 10.59254/sbpo-2019-107541 10.1007/BF01386390 10.1016/j.tcs.2011.10.002 10.1016/j.cor.2015.02.004 10.1007/s10878-012-9541-4 10.1016/j.cor.2018.05.003 10.1016/j.tcs.2010.11.046 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier B.V. |
| Copyright_xml | – notice: 2018 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2018.10.037 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 1101 |
| ExternalDocumentID | 10_1016_j_ejor_2018_10_037 S0377221718308907 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c365t-3e5f66b73c46bae0fcc5487e2340885554ebef16e2c0596d44ace828698e60593 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000457509200023&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 07:22:41 EST 2025 Tue Nov 18 22:22:11 EST 2025 Fri Feb 23 02:49:18 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Integer programming Computational geometry Combinatorial optimization Geometric firefighter routing problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c365t-3e5f66b73c46bae0fcc5487e2340885554ebef16e2c0596d44ace828698e60593 |
| ORCID | 0000-0002-5945-0845 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2018_10_037 crossref_primary_10_1016_j_ejor_2018_10_037 elsevier_sciencedirect_doi_10_1016_j_ejor_2018_10_037 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-05-01 |
| PublicationDateYYYYMMDD | 2019-05-01 |
| PublicationDate_xml | – month: 05 year: 2019 text: 2019-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Dijkstra (bib0006) 1959; 1 (Online; accessed 11 November 2017). Wang, Finbow, Wang (bib0022) 2014; 27 Zambon, M. J. O., de Rezende, P. J., & de Souza, C. C. (2018b). The geometric firefighter routing problem project. Ramos, N. (2018). Um estudo computacional do problema do brigadista em grafos. Master’s thesis. Campinas, Brazil, Institute of Computing, University of Campinas. Wang, Kong, Zhang (bib0023) 2012; 457 Gavenčiak, Kratochvíl, Prałat (bib0009) 2014; 337 Klein, Levcopoulos, Lingas (bib0012) 2014; 8392 [Online; accessed 11-Nov-2017]. Blum, Blesa, García-Martínez, Rodríguez, Lozano (bib0002) 2014; 8600 Zambon, de Rezende, de Souza (bib0025) 2016 Raphael Minder (2017). Deadly Fires Sweep Portugal and Northern Spain. King, MacGillivray (bib0011) 2010; 310 Agarwal, Sharir (bib0001) 1998 Bungiu, Hemmer, Hershberger, Huang, Kröller (bib0003) 2014; abs/1403.3905 Zambon, de Rezende, de Souza (bib0026) 2018; 97 Lynn Jenner (2017). Dozens of Wildfires in Western United States. Kong, Wang, Zhu (bib0013) 2012; 416 Kong, Zhang, Wang (bib0014) 2014; 334 Hu, Windbichler, Raidl (bib0010) 2015; 9026 Wang, Yue, Zhu (bib0024) 2011; 412 Costa, Dantas, Dourado, Penso, Rautenbach (bib0005) 2013; 161 Michalak (bib0016) 2017; 59 Seidel (bib0021) 1991; 1 Michalak (bib0017) 2017; 10197 [Online; accessed 27-Jul-2018]. Cai, Wang (bib0004) 2009; 23 García-Martínez, Blum, Rodríguez, Lozano (bib0008) 2015; 60 Finbow, King, MacGillivray, Rizzi (bib0007) 2007; 307 Sam Cowie (2017). Brazil’s worst month ever for forest fires blamed on human activity. Bungiu (10.1016/j.ejor.2018.10.037_bib0003) 2014; abs/1403.3905 Hu (10.1016/j.ejor.2018.10.037_bib0010) 2015; 9026 Klein (10.1016/j.ejor.2018.10.037_bib0012) 2014; 8392 10.1016/j.ejor.2018.10.037_bib0020 Agarwal (10.1016/j.ejor.2018.10.037_bib0001) 1998 Blum (10.1016/j.ejor.2018.10.037_bib0002) 2014; 8600 10.1016/j.ejor.2018.10.037_bib0027 Michalak (10.1016/j.ejor.2018.10.037_bib0016) 2017; 59 Zambon (10.1016/j.ejor.2018.10.037_bib0025) 2016 Dijkstra (10.1016/j.ejor.2018.10.037_bib0006) 1959; 1 Kong (10.1016/j.ejor.2018.10.037_bib0014) 2014; 334 García-Martínez (10.1016/j.ejor.2018.10.037_bib0008) 2015; 60 King (10.1016/j.ejor.2018.10.037_bib0011) 2010; 310 Cai (10.1016/j.ejor.2018.10.037_bib0004) 2009; 23 Kong (10.1016/j.ejor.2018.10.037_bib0013) 2012; 416 Wang (10.1016/j.ejor.2018.10.037_bib0022) 2014; 27 Gavenčiak (10.1016/j.ejor.2018.10.037_bib0009) 2014; 337 Wang (10.1016/j.ejor.2018.10.037_bib0023) 2012; 457 Michalak (10.1016/j.ejor.2018.10.037_bib0017) 2017; 10197 10.1016/j.ejor.2018.10.037_bib0015 Finbow (10.1016/j.ejor.2018.10.037_bib0007) 2007; 307 10.1016/j.ejor.2018.10.037_bib0018 10.1016/j.ejor.2018.10.037_bib0019 Wang (10.1016/j.ejor.2018.10.037_bib0024) 2011; 412 Seidel (10.1016/j.ejor.2018.10.037_bib0021) 1991; 1 Costa (10.1016/j.ejor.2018.10.037_bib0005) 2013; 161 Zambon (10.1016/j.ejor.2018.10.037_bib0026) 2018; 97 |
| References_xml | – volume: abs/1403.3905 year: 2014 ident: bib0003 article-title: Efficient computation of visibility polygons publication-title: Computing Research Repository – 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 Journal on Discrete Mathematics – volume: 9026 start-page: 25 year: 2015 end-page: 35 ident: bib0010 article-title: A new solution representation for the firefighter problem publication-title: Proceedings of the 15th European conferenc on evolutionary computation in combinatorial optimization – reference: Lynn Jenner (2017). Dozens of Wildfires in Western United States. – reference: Ramos, N. (2018). Um estudo computacional do problema do brigadista em grafos. Master’s thesis. Campinas, Brazil, Institute of Computing, University of Campinas. – volume: 97 start-page: 72 year: 2018 end-page: 83 ident: bib0026 article-title: Finding exact solutions for the geometric firefighter problem in practice publication-title: Computers – 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: Proceedings of the 14th European conference Evolutionary computation in combinatorial optimisation – volume: 161 start-page: 2410 year: 2013 end-page: 2419 ident: bib0005 article-title: More fires and more fighters publication-title: Discrete Applied Mathematics – volume: 1 start-page: 269 year: 1959 end-page: 271 ident: bib0006 article-title: A note on two problems in connexion with graphs publication-title: Numerische Mathematik – reference: Zambon, M. J. O., de Rezende, P. J., & de Souza, C. C. (2018b). The geometric firefighter routing problem project. – volume: 1 start-page: 51 year: 1991 end-page: 64 ident: bib0021 article-title: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons publication-title: Computational Geometry – volume: 337 start-page: 142 year: 2014 end-page: 155 ident: bib0009 article-title: Firefighting on square, hexagonal, and triangular grids publication-title: Discrete Mathematics – volume: 416 start-page: 65 year: 2012 end-page: 70 ident: bib0013 article-title: The surviving rate of planar graphs publication-title: Theoretical Computer Science – reference: . [Online; accessed 11-Nov-2017]. – volume: 457 start-page: 158 year: 2012 end-page: 165 ident: bib0023 article-title: The 2-surviving rate of planar graphs without 4-cycles publication-title: Theoretical Computer Science – volume: 334 start-page: 13 year: 2014 end-page: 19 ident: bib0014 article-title: The surviving rate of digraphs publication-title: Discrete Mathematics – reference: Raphael Minder (2017). Deadly Fires Sweep Portugal and Northern Spain. – volume: 60 start-page: 55 year: 2015 end-page: 66 ident: bib0008 article-title: The firefighter problem: Empirical results on random graphs publication-title: Computers & Operations Research – volume: 310 start-page: 614 year: 2010 end-page: 621 ident: bib0011 article-title: The firefighter problem for cubic graphs publication-title: Discrete Mathematics – volume: 10197 start-page: 108 year: 2017 end-page: 123 ident: bib0017 article-title: Estimation of distribution algorithms for the firefighter problem publication-title: Proceedings of the 17th European conference on evolutionary computation in combinatorial optimization – volume: 59 start-page: 389 year: 2017 end-page: 404 ident: bib0016 article-title: ED-LS - A heuristic local search for the multiobjective firefighter problem publication-title: Applied Soft Computing – volume: 307 start-page: 2094 year: 2007 end-page: 2105 ident: bib0007 article-title: The firefighter problem for graphs of maximum degree three publication-title: Discrete Mathematics – reference: Sam Cowie (2017). Brazil’s worst month ever for forest fires blamed on human activity. – volume: 412 start-page: 913 year: 2011 end-page: 921 ident: bib0024 article-title: The surviving rate of an outerplanar graph for the firefighter problem publication-title: Theoretical Computer Science – start-page: 223 year: 2016 end-page: 229 ident: bib0025 article-title: Exact solutions for the geometric firefighter problem publication-title: Proceedings of the 28th Canadian conference on computational geometry, – volume: 27 start-page: 621 year: 2014 end-page: 642 ident: bib0022 article-title: A lower bound of the surviving rate of a planar graph with girth at least seven publication-title: Journal of Combinatorial Optimization – reference: . [Online; accessed 27-Jul-2018]. – reference: . (Online; accessed 11 November 2017). – start-page: 49 year: 1998 end-page: 119 ident: bib0001 article-title: Arrangements and their applications publication-title: Handbook of computational geometry – volume: 8392 start-page: 261 year: 2014 end-page: 272 ident: bib0012 article-title: Approximation algorithms for the geometric firefighter and budget fence problems publication-title: Latin American symposium on theoretical informatics – volume: 161 start-page: 2410 issue: 16–17 year: 2013 ident: 10.1016/j.ejor.2018.10.037_bib0005 article-title: More fires and more fighters publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2013.04.008 – volume: 10197 start-page: 108 year: 2017 ident: 10.1016/j.ejor.2018.10.037_bib0017 article-title: Estimation of distribution algorithms for the firefighter problem – volume: 9026 start-page: 25 year: 2015 ident: 10.1016/j.ejor.2018.10.037_bib0010 article-title: A new solution representation for the firefighter problem – volume: 59 start-page: 389 year: 2017 ident: 10.1016/j.ejor.2018.10.037_bib0016 article-title: ED-LS - A heuristic local search for the multiobjective firefighter problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2017.05.049 – volume: 310 start-page: 614 issue: 3 year: 2010 ident: 10.1016/j.ejor.2018.10.037_bib0011 article-title: The firefighter problem for cubic graphs publication-title: Discrete Mathematics doi: 10.1016/j.disc.2009.05.007 – ident: 10.1016/j.ejor.2018.10.037_bib0020 – volume: abs/1403.3905 year: 2014 ident: 10.1016/j.ejor.2018.10.037_bib0003 article-title: Efficient computation of visibility polygons publication-title: Computing Research Repository – volume: 334 start-page: 13 year: 2014 ident: 10.1016/j.ejor.2018.10.037_bib0014 article-title: The surviving rate of digraphs publication-title: Discrete Mathematics doi: 10.1016/j.disc.2014.06.018 – volume: 1 start-page: 51 year: 1991 ident: 10.1016/j.ejor.2018.10.037_bib0021 article-title: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons publication-title: Computational Geometry doi: 10.1016/0925-7721(91)90012-4 – volume: 307 start-page: 2094 issue: 16 year: 2007 ident: 10.1016/j.ejor.2018.10.037_bib0007 article-title: The firefighter problem for graphs of maximum degree three publication-title: Discrete Mathematics doi: 10.1016/j.disc.2005.12.053 – volume: 457 start-page: 158 year: 2012 ident: 10.1016/j.ejor.2018.10.037_bib0023 article-title: The 2-surviving rate of planar graphs without 4-cycles publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2012.07.011 – volume: 337 start-page: 142 year: 2014 ident: 10.1016/j.ejor.2018.10.037_bib0009 article-title: Firefighting on square, hexagonal, and triangular grids publication-title: Discrete Mathematics doi: 10.1016/j.disc.2014.06.020 – ident: 10.1016/j.ejor.2018.10.037_bib0019 – ident: 10.1016/j.ejor.2018.10.037_bib0015 – ident: 10.1016/j.ejor.2018.10.037_bib0018 doi: 10.59254/sbpo-2019-107541 – volume: 1 start-page: 269 issue: 1 year: 1959 ident: 10.1016/j.ejor.2018.10.037_bib0006 article-title: A note on two problems in connexion with graphs publication-title: Numerische Mathematik doi: 10.1007/BF01386390 – volume: 416 start-page: 65 year: 2012 ident: 10.1016/j.ejor.2018.10.037_bib0013 article-title: The surviving rate of planar graphs publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2011.10.002 – volume: 60 start-page: 55 year: 2015 ident: 10.1016/j.ejor.2018.10.037_bib0008 article-title: The firefighter problem: Empirical results on random graphs publication-title: Computers & Operations Research doi: 10.1016/j.cor.2015.02.004 – start-page: 223 year: 2016 ident: 10.1016/j.ejor.2018.10.037_bib0025 article-title: Exact solutions for the geometric firefighter problem – volume: 8600 start-page: 218 year: 2014 ident: 10.1016/j.ejor.2018.10.037_bib0002 article-title: The firefighter problem: Application of hybrid ant colony optimization algorithms – volume: 27 start-page: 621 issue: 4 year: 2014 ident: 10.1016/j.ejor.2018.10.037_bib0022 article-title: A lower bound of the surviving rate of a planar graph with girth at least seven publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-012-9541-4 – ident: 10.1016/j.ejor.2018.10.037_bib0027 – volume: 97 start-page: 72 year: 2018 ident: 10.1016/j.ejor.2018.10.037_bib0026 article-title: Finding exact solutions for the geometric firefighter problem in practice publication-title: Computers & Operations Research doi: 10.1016/j.cor.2018.05.003 – volume: 412 start-page: 913 issue: 8–10 year: 2011 ident: 10.1016/j.ejor.2018.10.037_bib0024 article-title: The surviving rate of an outerplanar graph for the firefighter problem publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2010.11.046 – volume: 23 start-page: 1814 issue: 4 year: 2009 ident: 10.1016/j.ejor.2018.10.037_bib0004 article-title: The surviving rate of a graph for the firefighter problem publication-title: SIAM Journal on Discrete Mathematics – start-page: 49 year: 1998 ident: 10.1016/j.ejor.2018.10.037_bib0001 article-title: Arrangements and their applications – volume: 8392 start-page: 261 year: 2014 ident: 10.1016/j.ejor.2018.10.037_bib0012 article-title: Approximation algorithms for the geometric firefighter and budget fence problems |
| SSID | ssj0001515 |
| Score | 2.318525 |
| Snippet | •New GFP variants that allow for more general sets of barriers and solutions.•Problems solved to optimality through Integer Programming modeling.•Preprocessing... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1090 |
| SubjectTerms | Combinatorial optimization Computational geometry Geometric firefighter routing problem Integer programming |
| Title | Solving the geometric firefighter routing problem via integer programming |
| URI | https://dx.doi.org/10.1016/j.ejor.2018.10.037 |
| Volume | 274 |
| WOSCitedRecordID | wos000457509200023&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: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FFiE48Aggykt74GbZip9rH6uqiPZQkFqkiIvl7M6iRIldmSSq-hP41cx6Z42pQkUPXKxoHW8Sz5eZ2fU33zD2AbNcJTCs-xlo5SdCgF8IKPw0L1SUVLnOlOyaTYizs3w6Lb6MRj9dLcx2Keo6v7oqLv-rqXEMjW1KZ-9g7n5SHMDXaHQ8otnx-E-GP2-WW1cD9R2alWmZJT2Nrk2bhTi0Xtts1rYIvWsm423nlZWNwHPE11q5iLZr054SWBxo3VYiaQb1e8ufA-9btZoRNb-TLpo33mnQE3YCT5mOEddmB97yhFXb9A9EurPnzea6S22PiHVPmxOmHspRAV1RlhB-FNnyTOdwI9uXh5AVD9ynYYkOQjGmJuFON293HBYBLBqj6RrmgWHoWfWYPzW1b8S6noHoyG2L0sxRmjlwoMQ57rH9SKQFesj9w5Pj6Wkf103q1z2Top9EJViWLXjzm-xOcwapy8VT9pjWHPzQYuUZG0E9Zg9cycOYPXGtPTh5-jF7NNCpfM5OCFMcMcV7TPEBpjhhihOmOGKKE6b4AFMv2NePxxdHn3zqweHLOEvXfgypzrKZiGWSzSqYaCnNGheiOMH4lGIyil5AhxlE0jRyUklSSTDSBEUOmWkX-ZLt1U0NrxjXIGYAEyNeWyUiwsARhkormU8yjfdbHbDQ3bJSkkC96ZOyLP9urAPm9ddcWnmWW9-dOkuUlGDaxLFEYN1y3es7fcob9vD3X-Et21u3G3jH7svtev6jfU-o-gUt3p2V |
| 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=Solving+the+geometric+firefighter+routing+problem+via+integer+programming&rft.jtitle=European+journal+of+operational+research&rft.au=O.+Zambon%2C+Mauricio+J.&rft.au=J.+de+Rezende%2C+Pedro&rft.au=C.+de+Souza%2C+Cid&rft.date=2019-05-01&rft.issn=0377-2217&rft.volume=274&rft.issue=3&rft.spage=1090&rft.epage=1101&rft_id=info:doi/10.1016%2Fj.ejor.2018.10.037&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2018_10_037 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |