default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndréa C. Santos 0001
Person information
- affiliation: Le Havre Normandy University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Christophe Duhamel
, Andréa Cynthia Santos:
The strong network orientation problem. Int. Trans. Oper. Res. 31(1): 192-220 (2024)- [c8]Thiago Jobson Barbalho, Andréa Cynthia Santos, Juan Luis Jiménez Laredo, Christophe Duhamel:
Modelling and Solving a Scheduling Problem with Hazardous Products Dynamic Evolution. MIC (2) 2024: 249-263 - 2023
- [j34]Guilherme C. Pena, Andréa Cynthia Santos, Christian Prins:
Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters. Eur. J. Oper. Res. 306(1): 156-172 (2023) - [j33]Thiago Jobson Barbalho, Andréa Cynthia Santos, Dario José Aloise:
Metaheuristics for the work-troops scheduling problem. Int. Trans. Oper. Res. 30(2): 892-914 (2023) - [j32]Caio César De Freitas, Dario José Aloise, Fábio Francisco da Costa Fontes, Andréa Cynthia Santos, Matheus da Silva Menezes:
A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours. OR Spectr. 45(3): 903-924 (2023) - [j31]Matheus Nohra Haddad, Andréa Cynthia Santos, Christophe Duhamel, Amadeu Almeida Coco:
Intelligent Drone Swarms to Search for Victims in Post-Disaster Areas. Sensors 23(23): 9540 (2023) - 2022
- [j30]Amadeu Almeida Coco, Andréa Cynthia Santos, Thiago F. Noronha:
Robust min-max regret covering problems. Comput. Optim. Appl. 83(1): 111-141 (2022) - 2021
- [j29]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
Improving logic-based Benders' algorithms for solving min-max regret problems. Oper. Res. Decis. 31(2) (2021) - 2020
- [j28]Amadeu Almeida Coco, Christophe Duhamel, Andréa Cynthia Santos:
Modeling and solving the multi-period disruptions scheduling problem on urban networks. Ann. Oper. Res. 285(1): 427-443 (2020) - [j27]Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel:
Model and methods to address urban road network problems with disruptions. Int. Trans. Oper. Res. 27(6): 2715-2739 (2020) - [j26]Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel:
Bi-objective methods for road network problems with disruptions and connecting requirements. J. Oper. Res. Soc. 71(12): 1959-1971 (2020) - [i2]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs. CoRR abs/2001.00943 (2020)
2010 – 2019
- 2018
- [j25]Amadeu Almeida Coco, Andréa Cynthia Santos, Thiago F. Noronha:
Formulation and algorithms for the robust maximal covering location problem. Electron. Notes Discret. Math. 64: 145-154 (2018) - [j24]Yipeng Huang, Andréa Cynthia Santos, Christophe Duhamel:
Methods for solving road network problems with disruptions. Electron. Notes Discret. Math. 64: 175-184 (2018) - [j23]Andréa Cynthia Santos, Christophe Duhamel, Sebastián Urrutia:
Special issue on "Developments in Optimization for Smart Cities". Int. Trans. Oper. Res. 25(4): 1409-1410 (2018) - [j22]Puca Huachi Vaz Penna, Andréa Cynthia Santos, Christian Prins:
Vehicle routing problems for last mile distribution after major disaster. J. Oper. Res. Soc. 69(8): 1254-1268 (2018) - [c7]Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos:
A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem. ISCO 2018: 133-143 - [r1]Andréa Cynthia Santos, Christophe Duhamel, Rafael Andrade:
Trees and Forests. Handbook of Heuristics 2018: 1307-1333 - 2017
- [j21]Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade:
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. Comput. Oper. Res. 81: 51-66 (2017) - [j20]Alexandre Xavier Martins, Christophe Duhamel, Andréa Cynthia Santos:
A column generation approach for the strong network orientation problem. Electron. Notes Discret. Math. 62: 75-80 (2017) - [j19]Amadeu Almeida Coco, João Carlos Abreu Júnior, Thiago F. Noronha, Andréa Cynthia Santos:
Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Glob. Optim. 68(2): 463-466 (2017) - [j18]Luciana S. Pessoa, Andréa C. Santos, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the tree of hubs location problem. Optim. Lett. 11(7): 1371-1384 (2017) - 2016
- [j17]Christophe Duhamel, Andréa Cynthia Santos, Daniel Brasil, Eric Châtelet, Babiga Birregah:
Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations. Ann. Oper. Res. 247(2): 693-713 (2016) - [j16]Andréa Cynthia Santos, Christophe Duhamel, Lorena Silva Belisário:
Heuristics for designing multi-sink clustered WSN topologies. Eng. Appl. Artif. Intell. 50: 20-31 (2016) - [j15]Celso Satoshi Sakuraba, Andréa Cynthia Santos, Christian Prins, Lucie Bouillot, Arnaud Durand, Bernard Allenbach:
Road network emergency accessibility planning after a major earthquake. EURO J. Comput. Optim. 4(3-4): 381-402 (2016) - [j14]Celso Satoshi Sakuraba, Andréa Cynthia Santos, Christian Prins:
Work-troop scheduling for road network accessibility after a major earthquake. Electron. Notes Discret. Math. 52: 317-324 (2016) - [j13]Elyn L. Solano-Charris, Christian Prins, Andréa Cynthia Santos:
Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands. RAIRO Oper. Res. 50(4-5): 689-714 (2016) - [c6]Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade:
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs. ISCO 2016: 1-12 - [i1]Lucas Assunção, Thiago F. Noronha, Andréa Cynthia Santos, Rafael Andrade:
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs. CoRR abs/1609.09179 (2016) - 2015
- [j12]Elyn L. Solano-Charris, Christian Prins, Andréa Cynthia Santos:
Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios. Appl. Soft Comput. 32: 518-531 (2015) - [j11]Andréa Cynthia Santos, Christian Prins, Alice Yalaoui:
Preface. RAIRO Oper. Res. 49(1): 77-78 (2015) - [j10]Ernando Gomes de Sousa, Andréa Cynthia Santos, Dario José Aloise:
An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem. RAIRO Oper. Res. 49(1): 143-160 (2015) - 2014
- [j9]Hasan Murat Afsar, Christian Prins, Andréa Cynthia Santos:
Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 21(1): 153-175 (2014) - [j8]Andréa Cynthia Santos, Diego Rocha Lima, Dario José Aloise:
Modeling and solving the bi-objective minimum diameter-cost spanning tree problem. J. Glob. Optim. 60(2): 195-216 (2014) - [j7]Amadeu Almeida Coco, João Carlos Abreu Júnior, Thiago F. Noronha, Andréa Cynthia Santos:
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. J. Glob. Optim. 60(2): 265-287 (2014) - [c5]Elyn L. Solano-Charris, Christian Prins, Andréa Cynthia Santos:
A Robust optimization approach for the Vehicle Routing problem with uncertain travel cost. CoDIT 2014: 98-103 - [c4]Christophe Duhamel, Daniel Brasil, Andréa Cynthia Santos, Eric Châtelet, Babiga Birregah:
Strategies to Optimize the Impact of Supplies Distribution in Post-disaster Operations. ICORES 2014: 342-349 - [c3]Elyn L. Solano-Charris, Christian Prins, Andréa Cynthia Santos:
Heuristic Approaches for the Robust Vehicle Routing Problem. ISCO 2014: 384-395 - 2012
- [j6]Christophe Duhamel, Andréa Cynthia Santos, Lucas Moreira Guedes:
Models and hybrid methods for the onshore wells maintenance problem. Comput. Oper. Res. 39(12): 2944-2953 (2012) - [j5]Andréa Cynthia Santos, Christophe Duhamel, Lorena Silva Belisário, Lucas Moreira Guedes:
Strategies for designing energy-efficient clusters-based WSN topologies. J. Heuristics 18(4): 657-675 (2012) - 2010
- [j4]Thiago F. Noronha, Celso C. Ribeiro, Andréa C. Santos:
Solving diameter-constrained minimum spanning tree problems by constraint programming. Int. Trans. Oper. Res. 17(5): 653-665 (2010) - [j3]Abilio Lucena, Celso C. Ribeiro, Andréa C. Santos:
A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Glob. Optim. 46(3): 363-381 (2010)
2000 – 2009
- 2009
- [j2]Andréa C. Santos, Fatiha Bendali, Jean Mailfert, Christophe Duhamel, Kean Mean Hou:
Heuristics for Designing Energy-efficient Wireless Sensor Network Topologies. J. Networks 4(6): 436-444 (2009) - 2008
- [j1]Thiago F. Noronha, Andréa C. Santos, Celso C. Ribeiro:
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 30: 93-98 (2008) - [c2]Andréa C. Santos, Christophe Duhamel, Dario J. Aloise:
Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem. MCO 2008: 283-292 - [c1]Fatiha Bendali, Christophe Duhamel, Kean Mean Hou, Jean Mailfert, Andréa C. Santos:
An Optimization Approach for Designing Wireless Sensor Networks. NTMS 2008: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
