default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCláudio Alves
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Cláudio Alves, Israel Mendonça, Vanessa de Almeida Guimarèes, Pedro Henrique González:
ACO With Reinforcement Learning Applied to Rescues Operations on Urban Forests. CEC 2024: 1-8- 2023
- [j26]Mário Leite
, Telmo Pinto, Cláudio Alves:
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms. Expert Syst. Appl. 228: 120191 (2023) - [c15]Rita Martins, Telmo Pinto, Cláudio Alves:
An Exact Optimization Approach for Personnel Scheduling Problems in the Call Center Industry. ICCSA (Workshops 2) 2023: 407-424 - 2022
- [j25]Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho:
Arc flow formulations based on dynamic programming: Theoretical foundations and applications. Eur. J. Oper. Res. 296(1): 3-21 (2022) - [j24]Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho:
An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows. Int. Trans. Oper. Res. 29(1): 526-553 (2022) - 2021
- [c14]Carlos Balsa, Cláudio Alves, Ronan Guivarch, Sandrine Mouysset:
Dental Image Segmentation by Clustering Methods. ARTIIS 2021: 3-17 - 2020
- [j23]Cláudio Alves, Flávia Bernardini, Edwin B. Mitacc Meza, Leandro Sousa:
Evaluating the behaviour of stream learning algorithms for detecting invasion on wireless networks. Int. J. Secur. Networks 15(3): 133-140 (2020) - [j22]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Int. Trans. Oper. Res. 27(1): 549-572 (2020) - [i1]Vinícius Loti de Lima, Cláudio Alves, François Clautiaux, Manuel Iori, José M. Valério de Carvalho:
Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications. CoRR abs/2010.00558 (2020)
2010 – 2019
- 2018
- [j21]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Column generation based primal heuristics for routing and loading problems. Electron. Notes Discret. Math. 64: 135-144 (2018) - [j20]Bruna Ramos, Cláudio Alves, José M. Valério de Carvalho:
Column Generation Based Approaches for Combined Routing and Scheduling. Electron. Notes Discret. Math. 64: 155-164 (2018) - 2017
- [j19]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. Electron. Notes Discret. Math. 58: 111-118 (2017) - [j18]François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves:
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258(2): 467-477 (2017) - [c13]Mário Leite, Cláudio Alves, Telmo Pinto:
Variable Neighborhood Search for Integrated Planning and Scheduling. ICCSA (2) 2017: 709-724 - [c12]R. A. Sousa, Maria Leonilde R. Varela, Cláudio Alves, José Machado:
Job shop schedules analysis in the context of industry 4.0. ICE/ITMC 2017: 711-717 - [c11]Nuno Braga, Cláudio Alves, Rita Macedo:
Exact Solution of the Multi-trip Inventory Routing Problem using a Pseudo-polynomial Model. ICORES 2017: 250-257 - 2016
- [j17]Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho:
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. Comput. Oper. Res. 76: 183-194 (2016) - [c10]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints. ICCL 2016: 321-336 - 2015
- [j16]Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho:
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61: 143-152 (2015) - [j15]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux:
Constructing general dual-feasible functions. Oper. Res. Lett. 43(4): 427-431 (2015) - [c9]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Fast Heuristics for Integrated Planning and Scheduling. ICCSA (2) 2015: 413-428 - [c8]Telmo Pinto, Cláudio Alves, José M. Valério de Carvalho:
Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints. ICCSA (2) 2015: 474-489 - [c7]Nuno Braga, Cláudio Alves, Rita Macedo, José M. Valério de Carvalho:
A Model-Based Heuristic for the Combined Cutting Stock and Scheduling Problem. ICCSA (2) 2015: 490-505 - 2014
- [j14]Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Jürgen Rietz:
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur. J. Oper. Res. 233(1): 43-63 (2014) - [c6]Jürgen Rietz, Cláudio Alves, José Manuel Valério de Carvalho, François Clautiaux:
On the Properties of General Dual-Feasible Functions. ICCSA (2) 2014: 180-194 - 2012
- [j13]Cláudio Alves, Pedro Brás, José M. Valério de Carvalho, Telmo Pinto:
New constructive algorithms for leather nesting in the automotive industry. Comput. Oper. Res. 39(7): 1487-1505 (2012) - [j12]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Worst-case analysis of maximal dual feasible functions. Optim. Lett. 6(8): 1687-1705 (2012) - [j11]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
On the extremality of maximal dual feasible functions. Oper. Res. Lett. 40(1): 25-30 (2012) - [c5]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux:
Computing Valid Inequalities for General Integer Programs using an Extension of Maximal Dual Feasible Functions to Negative Arguments. ICORES 2012: 39-47 - [c4]Cláudio Alves, Raïd Mansi, Telmo Pinto, José M. Valério de Carvalho:
A Column Generation Approach for the Bi-objective Max-min Knapsack Problem. ICORES 2012: 165-170 - [c3]Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho:
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. ICORES 2012: 305-312 - [c2]Ana Terto, Cláudio Alves, Janicy Rocha, Raquel O. Prates:
Imagem e privacidade: contradições no Facebook. IHC (Companion) 2012: 71-72 - 2011
- [j10]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi:
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3): 536-545 (2011) - [j9]François Clautiaux, Cláudio Alves, José M. Valério de Carvalho, Jürgen Rietz:
New Stabilization Procedures for the Cutting Stock Problem. INFORMS J. Comput. 23(4): 530-545 (2011) - 2010
- [j8]François Clautiaux, Cláudio Alves, José M. Valério de Carvalho:
A survey of dual-feasible and superadditive functions. Ann. Oper. Res. 179(1): 317-342 (2010) - [j7]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho:
Arc-flow model for the two-dimensional guillotine cutting stock problem. Comput. Oper. Res. 37(6): 991-1001 (2010) - [j6]Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Theoretical investigations on maximal dual feasible functions. Oper. Res. Lett. 38(3): 174-178 (2010)
2000 – 2009
- 2009
- [j5]Cláudio Alves, Rita Macedo, José M. Valério de Carvalho:
New lower bounds based on column generation and constraint programming for the pattern minimization problem. Comput. Oper. Res. 36(11): 2944-2954 (2009) - [c1]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho:
Exact Algorithms for Vehicle Routing Problems with Different Service Constraints. CTW 2009: 215-218 - 2008
- [j4]Cláudio Alves, José M. Valério de Carvalho:
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35(4): 1315-1328 (2008) - [j3]Cláudio Alves, José M. Valério de Carvalho:
New integer programming formulations and an exact algorithm for the ordered cutting stock problem. J. Oper. Res. Soc. 59(11): 1520-1531 (2008) - [j2]Cláudio Alves, José M. Valério de Carvalho:
A branch-and-price-and-cut algorithm for the pattern minimization problem. RAIRO Oper. Res. 42(4): 435-453 (2008) - 2007
- [j1]Cláudio Alves, José M. Valério de Carvalho:
Accelerating column generation for variable sized bin-packing problems. Eur. J. Oper. Res. 183(3): 1333-1352 (2007)
Coauthor Index
aka: José Manuel Valério de Carvalho
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-08-21 20:24 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:
