default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPablo Sartor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Héctor Cancela, Leslie Murray, Franco Robledo, Pablo Romero, Pablo Sartor:
On the reliability estimation of stochastic binary systems. Int. Trans. Oper. Res. 29(3): 1688-1722 (2022)- [j10]Eduardo A. Canale
, Franco Robledo, Pablo Sartor, Luis Stábile:
Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach. Symmetry 14(1): 18 (2022) - 2021
- [c6]Gabriel Bayá, Pablo Sartor, Franco Robledo, Eduardo A. Canale, Sergio Nesmachnow:
A Case Study of Smart Industry in Uruguay: Grain Production Facility Optimization. ICSC-Cities 2021: 101-115 - [c5]Matías Banchero, Franco Robledo, Pablo Romero, Pablo Sartor, Camilo Servetti:
Max-Diversity Orthogonal Regrouping of MBA Students Using a GRASP/VND Heuristic. ICVNS 2021: 58-70
2010 – 2019
- 2015
- [j9]Eduardo Alberto Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5): 811-821 (2015) - [j8]Eduardo Alberto Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior. Networks 66(4): 296-305 (2015) - [c4]Eduardo Alberto Canale, Héctor Cancela, Juan Piccini, Franco Robledo, Pablo Romero, Gerardo Rubino, Pablo Sartor:
Recursive Variance Reduction method in stochastic monotone binary systems. RNDM@WMNC 2015: 135-141 - 2014
- [j7]Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Romero, Pablo Sartor:
Diameter-constrained K-reliability evaluation: complexity and heuristics. Int. J. Metaheuristics 3(3): 223-243 (2014) - [j6]Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Sartor:
The complexity of computing the 2-K-reliability in networks. Inf. Process. Lett. 114(9): 457-461 (2014) - [j5]Héctor Cancela, Franco Robledo, Gerardo Rubino, Pablo Sartor:
Efficient estimation of distance-dependent metrics in edge-failing networks. Int. Trans. Oper. Res. 21(2): 199-213 (2014) - [j4]Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Pablo Sartor:
Monte Carlo methods in diameter-constrained reliability. Opt. Switch. Netw. 14: 134-148 (2014) - 2013
- [j3]Héctor Cancela, Franco Robledo, Gerardo Rubino, Pablo Sartor:
Monte Carlo estimation of diameter-constrained network reliability conditioned by pathsets and cutsets. Comput. Commun. 36(6): 611-620 (2013) - [j2]Franco Robledo, Pablo Sartor:
A simulation method for network performability estimation using heuristically computed pathsets and cutsets. Int. J. Metaheuristics 2(4): 370-391 (2013) - [j1]Eduardo Alberto Canale, Héctor Cancela, Franco Robledo, Gerardo Rubino, Pablo Sartor:
On computing the 2-diameter -constrained K -reliability of networks. Int. Trans. Oper. Res. 20(1): 49-58 (2013) - [c3]Franco Robledo, Pablo Romero, Pablo Sartor:
A novel Interpolation technique to address the Edge-Reliability Problem. ICUMT 2013: 187-192 - [i1]Pablo Sartor, Franco Robledo:
A simulation Method for Network Performability Estimation using Heuristically-computed Pathsets and Cutsets. CoRR abs/1303.5302 (2013) - 2012
- [c2]Héctor Cancela, Franco Robledo, Gerardo Rubino, Pablo Sartor:
A Monte Carlo sampling plan for estimating diameter-dependent network parameters. ICUMT 2012: 766-771 - 2011
- [c1]Pablo Sartor, Franco Robledo:
Solving the Generalized Steiner Problem in Edge-Survivable Networks. FGIT-CA/CES3 2011: 7-16
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-04-24 23:03 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:
