default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSantiago Valdés Ravelo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Santiago Valdés Ravelo
, Cristina G. Fernandes:
Complexity and approximability of Minimum Path-Collection Exact Covers. Theor. Comput. Sci. 942: 21-32 (2023)- 2022
- [j7]Santiago Valdés Ravelo:
Approximation algorithms for simple assembly line balancing problems. J. Comb. Optim. 43(2): 432-443 (2022) - [c5]Felipe Furtado Lorenci, Santiago Valdés Ravelo:
A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem. CEC 2022: 1-8 - [c4]Tiago F. D. Pinheiro, Santiago Valdés Ravelo, Luciana S. Buriol:
A fix-and-optimize matheuristic for the k-labelled spanning forest problem. CEC 2022: 1-8 - 2021
- [j6]Santiago Valdés Ravelo, Cláudio N. Meneses:
Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems. Comput. Oper. Res. 135: 105441 (2021) - [j5]Santiago Valdés Ravelo:
Minimum constellation covers: hardness, approximability and polynomial cases. J. Comb. Optim. 41(3): 603-624 (2021) - 2020
- [j4]Eduardo A. J. Anacleto, Cláudio N. Meneses, Santiago Valdés Ravelo:
Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. Comput. Oper. Res. 113 (2020) - [j3]Santiago Valdés Ravelo, Cláudio N. Meneses, Maristela Oliveira Santos:
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. J. Heuristics 26(4): 585-618 (2020) - [c3]Santiago Valdés Ravelo, Cláudio N. Meneses, Eduardo A. J. Anacleto:
NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem. CEC 2020: 1-8
2010 – 2019
- 2019
- [j2]Santiago Valdés Ravelo, Carlos Eduardo Ferreira:
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem. Theor. Comput. Sci. 771: 9-22 (2019) - 2017
- [j1]Santiago Valdés Ravelo, Carlos Eduardo Ferreira:
A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. Discret. Appl. Math. 228: 158-175 (2017) - 2016
- [b1]Santiago Valdés Ravelo:
Optimum communication spanning tree problem: variants, complexity and approximation. University of São Paulo, Brazil, 2016 - 2015
- [c2]Santiago Valdés Ravelo, Carlos E. Ferreira:
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem. CALDAM 2015: 9-20 - [c1]Santiago Valdés Ravelo, Carlos E. Ferreira:
PTAS's for Some Metric p-source Communication Spanning Tree Problems. WALCOM 2015: 137-148
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 2025-01-20 22:44 CET 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:
