default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilipe Pereira Alvelos
Person information
- affiliation: University of Minho, Braga, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Marina A. Matos
, Rui Gonçalves, Ana Maria A. C. Rocha, Lino A. Costa, Filipe Pereira Alvelos:
A Firefighting Resource Dispatch Problem Optimization Using Metaheuristics. ICCSA (Workshops 2) 2024: 313-323- 2023
- [j17]André Bergsten Mendes, Filipe Pereira e Alvelos:
Iterated local search for the placement of wildland fire suppression resources. Eur. J. Oper. Res. 304(3): 887-900 (2023) - [j16]Isabel Martins, Filipe Pereira Alvelos, Adelaide Cerveira, Jan Kaspar, Robert Marusák:
Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity. Int. Trans. Oper. Res. 30(6): 3930-3948 (2023) - [c21]Filipe Pereira Alvelos, Sarah Moura, António Vieira, António Bento-Gonçalves:
A Bi-objective Optimization Approach for Wildfire Detection. ICCSA (Workshops 2) 2023: 425-436 - [c20]Marina A. Matos, Ana Maria A. C. Rocha, Lino A. Costa, Filipe Pereira Alvelos:
Resource Dispatch Optimization for Firefighting Based on Genetic Algorithm. ICCSA (Workshops 2) 2023: 437-453 - [c19]Marina A. Matos, Rui Gonçalves, Ana Maria A. C. Rocha, Lino A. Costa, Filipe Pereira Alvelos:
Resource Dispatch Optimization for Firefighting Using a Differential Evolution Algorithm. OL2A (1) 2023: 63-77 - 2022
- [j15]Andreia Araújo, Filipe Portela, Filipe Pereira Alvelos, Saulo Ruiz:
Optimization of the System of Allocation of Overdue Loans in a Sub-Saharan Africa Microfinance Institution. Future Internet 14(6): 163 (2022) - [c18]Marina A. Matos, Ana Maria A. C. Rocha, Lino A. Costa, Filipe Pereira Alvelos:
A Genetic Algorithm for Forest Firefighting Optimization. ICCSA (Workshops 2) 2022: 55-67 - 2021
- [c17]Andreia Araújo, Filipe Portela, Filipe Pereira Alvelos, Saulo Ruiz:
Allocation of Overdue Loans in a Sub-Saharan Africa Microfinance Institution. MIKE 2021: 128-137
2010 – 2019
- 2019
- [j14]Filipe Pereira Alvelos, Xenia Klimentova, Ana Viana:
Maximizing the expected number of transplants in kidney exchange programs with branch-and-price. Ann. Oper. Res. 272(1-2): 429-444 (2019) - [c16]Valeria Romanciuc, Filipe Pereira Alvelos:
Optimizing the Kidney Exchange Problem with a Budget for Simultaneous Crossmatch Tests. ICCSA (3) 2019: 277-288 - [c15]Filipe Alves, Filipe Pereira Alvelos, Ana Maria A. C. Rocha, Ana I. Pereira, Paulo Leitão:
Periodic Vehicle Routing Problem in a Health Unit. ICORES 2019: 384-389 - 2018
- [j13]Abdur Rais, Filipe Pereira Alvelos, João Figueiredo, Ana Nobre:
Optimization of logistics services in hospitals. Int. Trans. Oper. Res. 25(1): 111-132 (2018) - [c14]Filipe Pereira Alvelos:
Mixed Integer Programming Models for Fire Fighting. ICCSA (2) 2018: 637-652 - 2017
- [c13]Filipe Pereira Alvelos, Ana Viana:
Kidney Exchange Programs with a Priori Crossmatch Probing. OR 2017: 363-368 - 2016
- [j12]Filipe Pereira Alvelos, Xenia Klimentova, Abdur Rais, Ana Viana:
Maximizing expected number of transplants in kidney exchange programs. Electron. Notes Discret. Math. 52: 269-276 (2016) - [c12]Vitor Barbosa, Ana Respício, Filipe Pereira Alvelos:
A Repair Operator for Global Solutions of Decomposable Problems. STAIRS 2016: 143-154 - 2015
- [c11]Vitor Barbosa, Ana Respício, Filipe Pereira Alvelos:
A Column Generation Based Heuristic for a Bus Driver Rostering Problem. EPIA 2015: 143-156 - [c10]Vitor Barbosa, Ana Respício, Filipe Pereira Alvelos:
Comparing Hybrid Metaheuristics for the Bus Driver Rostering Problem. KES-IDT 2015: 43-53 - 2014
- [j11]Abdur Rais, Filipe Pereira Alvelos, Maria Sameiro Carvalho:
New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur. J. Oper. Res. 235(3): 530-539 (2014) - [j10]Elsa Silva, Filipe Pereira Alvelos, José M. Valério de Carvalho:
Integrating two-dimensional cutting stock and lot-sizing problems. J. Oper. Res. Soc. 65(1): 108-123 (2014) - [c9]Filipe Pereira Alvelos, Elsa Silva, José Manuel Valério de Carvalho:
A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems. ICCSA (2) 2014: 211-226 - [c8]Xenia Klimentova, Filipe Pereira Alvelos, Ana Viana:
A New Branch-and-Price Approach for the Kidney Exchange Problem. ICCSA (2) 2014: 237-252 - [c7]Manuel Lopes, Filipe Pereira Alvelos, Henrique Lopes:
Improving Branch-and-Price for Parallel Machine Scheduling. ICCSA (2) 2014: 290-300 - 2013
- [j9]Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos:
A hybrid column generation with GRASP and path relinking for the network load balancing problem. Comput. Oper. Res. 40(12): 3147-3158 (2013) - [j8]Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos, Michal Pióro:
Optimizing network load balancing: an hybridization approach of metaheuristics with column generation. Telecommun. Syst. 52(2): 959-968 (2013) - [c6]Rui Alves, Filipe Pereira Alvelos, Sérgio Dinis T. Sousa:
Resource Constrained Project Scheduling with General Precedence Relations Optimized with SAT. EPIA 2013: 199-210 - [c5]Vitor Barbosa, Ana Respício, Filipe Pereira Alvelos:
A Hybrid Metaheuristic for the Bus Driver Rostering Problem. ICORES 2013: 32-42 - [p1]Filipe Pereira Alvelos, Amaro de Sousa, Dorabella Santos:
Combining Column Generation and Metaheuristics. Hybrid Metaheuristics 2013: 285-334 - 2012
- [j7]Isabel Martins, Filipe Pereira Alvelos, Miguel Constantino:
A branch-and-price approach for harvest scheduling subject to maximum area restrictions. Comput. Optim. Appl. 51(1): 363-385 (2012) - [c4]Tiago Costa Gomes, Filipe Pereira Alvelos, Maria Sameiro Carvalho:
Design of Wood Biomass Supply Chains. ICCSA (3) 2012: 30-44 - 2011
- [j6]T. M. Chan, Filipe Pereira Alvelos, Elsa Silva, José M. Valério de Carvalho:
Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems. Asia Pac. J. Oper. Res. 28(2): 255-278 (2011) - [j5]Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, António J. S. T. Duarte, José M. Valério de Carvalho:
Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines. Int. J. Manuf. Technol. Manag. 22(1): 39-57 (2011) - [j4]Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos, Mateusz Dzida, Michal Pióro:
Optimization of link load balancing in multiple spanning tree routing networks. Telecommun. Syst. 48(1-2): 109-124 (2011) - 2010
- [j3]Elsa Silva, Filipe Pereira Alvelos, José M. Valério de Carvalho:
An integer programming model for two- and three-stage two-dimensional cutting stock problems. Eur. J. Oper. Res. 205(3): 699-708 (2010) - [j2]Carina Maria Oliveira Pimentel, Filipe Pereira Alvelos, José Manuel Valério de Carvalho:
Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optim. Methods Softw. 25(2): 299-319 (2010) - [c3]Filipe Pereira Alvelos, Amaro de Sousa, Dorabella Santos:
SearchCol: Metaheuristic Search by Column Generation. Hybrid Metaheuristics 2010: 190-205
2000 – 2009
- 2009
- [c2]Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos, Mateusz Dzida, Michal Pióro, Michal Zagozdzon:
Traffic Engineering of Multiple Spanning Tree Routing Networks: the Load Balancing Case. NGI 2009: 1-8 - 2008
- [c1]Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos:
Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing. FITraMEn 2008: 114-129 - 2007
- [j1]Filipe Pereira Alvelos, José M. Valério de Carvalho:
An extended model and a column generation algorithm for the planar multicommodity flow problem. Networks 50(1): 3-16 (2007)
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:15 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:
