default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan Sebastian Borrero
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Niloufar Daemi
, Juan Sebastian Borrero, Balabhaskar Balasundaram:
First passage time interdiction in Markov chains. Oper. Res. Lett. 54: 107111 (2024)- 2023
- [j14]Mehdi Ansari, Juan Sebastian Borrero, Leonardo Lozano:
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions. INFORMS J. Comput. 35(1): 83-103 (2023) - 2022
- [j13]Balabhaskar Balasundaram, Juan Sebastian Borrero, Hao Pan:
Graph signatures: Identification and optimization. Eur. J. Oper. Res. 296(3): 764-775 (2022) - [j12]Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Learning in Sequential Bilevel Linear Programming. INFORMS J. Optim. 4(2): 174-199 (2022) - [j11]Niloufar Daemi, Juan Sebastian Borrero, Balabhaskar Balasundaram:
Interdicting Low-Diameter Cohesive Subgroups in Large-Scale Social Networks. INFORMS J. Optim. 4(3): 304-325 (2022) - 2021
- [j10]Jing Yang, Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Sequential Shortest Path Interdiction with Incomplete Information and Limited Feedback. Decis. Anal. 18(3): 218-244 (2021) - [j9]Juan Sebastian Borrero, Leonardo Lozano:
Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets. INFORMS J. Comput. 33(4): 1570-1589 (2021) - [j8]Juan Sebastian Borrero, Majid Akhgar, Pavlo A. Krokhmal:
A Scalable Markov Chain Framework for Influence Maximization in Arbitrary Networks. IEEE Trans. Netw. Sci. Eng. 8(3): 2372-2387 (2021) - 2019
- [j7]M. Hosein Zare, Juan Sebastian Borrero, Bo Zeng, Oleg A. Prokopyev:
A note on linearized reformulations for a class of bilevel linear integer problems. Ann. Oper. Res. 272(1-2): 99-117 (2019) - [j6]Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Sequential Interdiction with Incomplete Information and Learning. Oper. Res. 67(1): 72-89 (2019) - [j5]Juan Sebastian Borrero, Oleg A. Prokopyev, Pavlo A. Krokhmal:
Optimization of Cascading Processes in Arbitrary Networks with Stochastic Interactions. IEEE Trans. Netw. Sci. Eng. 6(4): 773-787 (2019) - 2017
- [j4]Juan Sebastian Borrero, Colin P. Gillen, Oleg A. Prokopyev:
Fractional 0-1 programming: applications and algorithms. J. Glob. Optim. 69(1): 255-282 (2017) - 2016
- [j3]Juan Sebastian Borrero, Oleg A. Prokopyev, Denis Sauré:
Sequential Shortest Path Interdiction with Incomplete Information. Decis. Anal. 13(1): 68-98 (2016) - [j2]Juan Sebastian Borrero, Colin P. Gillen, Oleg A. Prokopyev:
A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems. Oper. Res. Lett. 44(4): 479-486 (2016) - 2013
- [j1]Juan Sebastian Borrero, Raha Akhavan-Tabatabaei:
Time and inventory dependent optimal maintenance policies for single machine workstations: An MDP approach. Eur. J. Oper. Res. 228(3): 545-555 (2013)
Conference and Workshop Papers
- 2022
- [c2]Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero:
A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. INOC 2022: 1-6 - 2010
- [c1]Juan Sebastian Borrero, Raha Akhavan-Tabatabaei:
A Markov Decision Process model for optimal policy making in the maintenance of a single-machine single-product toolset. WSC 2010: 2594-2605
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-07-20 21:20 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:
