default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastián Urrutia
Person information
- affiliation: Federal University of Minas Gerais, Belo Horizonte, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Clynton Tomacheski, Anolan Milanés, Sebastián Urrutia
:
The nilcatenation problem and its application for detecting money laundering activities in cryptocurrency networks. Int. Trans. Oper. Res. 31(6): 3955-3974 (2024)- [j42]Caio Henrique Segawa Tonetti, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Polynomial time algorithms for the token swapping problem on cographs. RAIRO Oper. Res. 58(1): 441-455 (2024) - [j41]Carlos V. G. C. Lima, Vinícius Fernandes dos Santos, João H. G. Sousa, Sebastián Alberto Urrutia:
On the computational complexity of the strong geodetic recognition problem. RAIRO Oper. Res. 58(5): 3755-3770 (2024) - [c12]Sebastián Urrutia, Vinícius Fernandes dos Santos:
Finding the Minimum Cost Acceptable Element in a Sorted Matrix. SEA 2024: 28:1-28:14 - 2023
- [j40]Kjetil Fagerholt, Lars Magnus Hvattum, Dimitri J. Papageorgiou, Sebastián Urrutia:
Maritime inventory routing: recent trends and future directions. Int. Trans. Oper. Res. 30(6): 3013-3056 (2023) - [j39]Celso C. Ribeiro, Sebastián Urrutia, Dominique de Werra:
A tutorial on graph models for scheduling round-robin sports tournaments. Int. Trans. Oper. Res. 30(6): 3267-3295 (2023) - 2022
- [j38]Vinícius Fernandes dos Santos, Sebastián Urrutia:
Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil. Discret. Appl. Math. 323: 1 (2022) - [j37]Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Alberto Urrutia:
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Eur. J. Oper. Res. 300(1): 207-220 (2022) - [j36]Armando Honorio Pereira, Geraldo Robson Mateus, Sebastián Urrutia:
Branch-and-cut algorithms for the -arborescence star problem. Int. Trans. Oper. Res. 29(4): 2374-2400 (2022) - [i6]Carlos V. G. C. Lima, Vinícius Fernandes dos Santos, João H. G. Sousa, Sebastián Alberto Urrutia:
On the Computational Complexity of the Strong Geodetic Recognition Problem. CoRR abs/2208.01796 (2022) - [i5]Evellyn S. Cavalcante, Sebastián Urrutia, Vinícius Fernandes dos Santos:
On the arboreal jump number of a poset. CoRR abs/2209.01270 (2022) - 2021
- [j35]Rodrigo Ferreira da Silva, Sebastián Urrutia, Lars Magnus Hvattum:
Extended high dimensional indexing approach for reachability queries on very large graphs. Expert Syst. Appl. 181: 114962 (2021) - [j34]Heber F. Amaral, Sebastián Urrutia, Lars Magnus Hvattum:
Delayed improvement local search. J. Heuristics 27(5): 923-950 (2021) - [j33]Sebastián Urrutia, Dominique de Werra, Tiago Januario:
Recoloring subgraphs of K2n for sports scheduling. Theor. Comput. Sci. 877: 36-45 (2021) - [c11]Eduardo T. Bogue, Marcos V. A. Guimarães, Thiago F. Noronha, Armando Honorio Pereira, Iago A. Carvalho, Sebastián Urrutia:
The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints. CLEI 2021: 1-9 - 2020
- [j32]Line Eide, Gro Cesilie Håhjem Årdal, Nataliia Evsikova, Lars Magnus Hvattum, Sebastián Urrutia:
Load-dependent speed optimization in maritime inventory routing. Comput. Oper. Res. 123: 105051 (2020) - [j31]Marcelo Fonseca Faraj, Sebastián Urrutia, João F. Machry Sarubbi:
Gamma deployment problem in grids: hardness and new integer linear programming formulation. Int. Trans. Oper. Res. 27(6): 2740-2759 (2020)
2010 – 2019
- 2019
- [j30]Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia, Johan Oppen:
The matching relaxation for a class of generalized set partitioning problems. Discret. Appl. Math. 253: 153-166 (2019) - [j29]Rodrigo Ferreira da Silva, Sebastián Urrutia, Vinícius Fernandes dos Santos:
One-Sided Weak Dominance Drawing. Theor. Comput. Sci. 757: 36-43 (2019) - [c10]Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Preface. LAGOS 2019: 1-2 - [e1]Gabriel Coutinho, Yoshiharu Kohayakawa, Vinícius Fernandes dos Santos, Sebastián Urrutia:
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019. Electronic Notes in Theoretical Computer Science 346, Elsevier 2019 [contents] - 2018
- [j28]Armando Honorio Pereira, Sebastián Urrutia:
Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks. Comput. Oper. Res. 93: 1-14 (2018) - [j27]Sebastián Urrutia, Dominique de Werra:
What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems? Eur. J. Oper. Res. 270(2): 430-434 (2018) - [j26]Andréa Cynthia Santos, Christophe Duhamel, Sebastián Urrutia:
Special issue on "Developments in Optimization for Smart Cities". Int. Trans. Oper. Res. 25(4): 1409-1410 (2018) - [c9]Anna Zaitseva, Lars Magnus Hvattum, Sebastián Urrutia:
Profit Maximization in Inventory Routing Problems. IEEM 2018: 1230-1234 - 2017
- [j25]Afonso H. Sampaio, Sebastián Urrutia:
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Int. Trans. Oper. Res. 24(1-2): 77-98 (2017) - 2016
- [j24]Rafael A. Melo, Phillippe Samer, Sebastián Urrutia:
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65(3): 821-844 (2016) - [j23]Tiago Januario, Sebastián Urrutia:
A new neighborhood structure for round robin scheduling problems. Comput. Oper. Res. 70: 127-139 (2016) - [j22]Tiago Januario, Sebastián Urrutia, Dominique de Werra:
Sports scheduling search space connectivity: A riffle shuffle driven approach. Discret. Appl. Math. 211: 113-120 (2016) - [j21]Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia:
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems. Electron. Notes Discret. Math. 55: 85-88 (2016) - [j20]Tiago Januario, Sebastián Urrutia, Celso C. Ribeiro, Dominique de Werra:
Edge coloring: A natural model for sports scheduling. Eur. J. Oper. Res. 254(1): 1-8 (2016) - [i4]Afonso H. Sampaio, Sebastián Urrutia, Johan Oppen:
A Decomposition Approach to Solve The Quay Crane Scheduling Problem. CoRR abs/1604.00527 (2016) - [i3]Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia:
A combinatorial relaxation methodology for berth allocation problems. CoRR abs/1606.09279 (2016) - 2015
- [j19]Sebastián Urrutia, Abilio Lucena:
Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499]. Discret. Appl. Math. 185: 254-255 (2015) - [j18]Sílvia Maria Santana Mapa, Sebastián Urrutia:
On the maximum acyclic subgraph problem under disjunctive constraints. Inf. Process. Lett. 115(2): 119-124 (2015) - [j17]Sebastián Urrutia, Anolan Milanés, Arne Løkketangen:
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks. Int. Trans. Oper. Res. 22(1): 61-75 (2015) - [j16]Phillippe Samer, Sebastián Urrutia:
A branch and cut algorithm for minimum spanning trees under conflict constraints. Optim. Lett. 9(1): 41-55 (2015) - [i2]Rafael A. Melo, Phillippe Samer, Sebastián Urrutia:
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. CoRR abs/1509.06562 (2015) - 2014
- [j15]Sebastián Urrutia, Abilio Lucena:
Characterizing acyclic graphs by labeling edges. Discret. Appl. Math. 164: 492-499 (2014) - 2013
- [c8]Lucas Middeldorf Rizzo, Sebastián Urrutia, Antonio A. F. Loureiro:
Role Assignment in Wireless Sensor Networks Based on Vertex Coloring. SOSE 2013: 537-545 - [i1]Phillippe Samer, Sebastián Urrutia:
A branch and cut algorithm for minimum spanning trees under conflict constraints. CoRR abs/1307.1424 (2013) - 2012
- [j14]Fabrício N. Costa, Sebastián Urrutia, Celso C. Ribeiro:
An ILS heuristic for the traveling tournament problem with predefined venues. Ann. Oper. Res. 194(1): 137-150 (2012) - [j13]Celso C. Ribeiro, Sebastián Urrutia:
Scheduling the Brazilian Soccer Tournament: Solution Approach and Practice. Interfaces 42(3): 260-272 (2012) - [c7]Phillippe Samer, Afonso H. Sampaio, Anolan Milanés, Sebastián Urrutia:
Designing a Multicore Graph Library. ISPA 2012: 721-728 - 2011
- [j12]Sebastián Urrutia, Abilio Lucena:
A New Formulation for Spanning Trees. Electron. Notes Discret. Math. 37: 195-200 (2011) - 2010
- [j11]Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia:
Scheduling in sports: An annotated bibliography. Comput. Oper. Res. 37(1): 1-19 (2010) - [j10]Rodrigo Ferreira da Silva, Sebastián Urrutia:
A General VNS heuristic for the traveling salesman problem with time windows. Discret. Optim. 7(4): 203-211 (2010) - [j9]André César Medeiros, Sebastián Urrutia:
Discrete optimization methods to determine trajectories for Dubins' vehicles. Electron. Notes Discret. Math. 36: 17-24 (2010)
2000 – 2009
- 2009
- [j8]Rafael A. Melo, Sebastián Urrutia, Celso C. Ribeiro:
The traveling tournament problem with predefined venues. J. Sched. 12(6): 607-622 (2009) - 2008
- [j7]Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline T. M. Rocha, Sebastián Urrutia:
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem. Eur. J. Oper. Res. 191(3): 596-611 (2008) - [j6]Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline T. M. Rocha, Sebastián Urrutia:
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur. J. Oper. Res. 191(3): 981-992 (2008) - [j5]Carlos José Pereira de Lucena, Thiago F. Noronha, Celso C. Ribeiro, Sebastián Urrutia:
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments. Int. Trans. Oper. Res. 15(6): 739-753 (2008) - 2007
- [j4]Celso C. Ribeiro, Sebastián Urrutia:
Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179(3): 775-787 (2007) - [c6]Sebastián Urrutia, Celso C. Ribeiro, Rafael A. Melo:
A New Lower Bound to the Traveling Tournament Problem. CISched 2007: 15-18 - [c5]Alexandre R. Duarte, Celso C. Ribeiro, Sebastián Urrutia:
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy. Hybrid Metaheuristics 2007: 82-95 - [p1]Aletéia P. F. Araújo, Cristina Boeres, Vinod E. F. Rebello, Celso C. Ribeiro, Sebastián Urrutia:
Exploring Grid Implementations of Parallel Cooperative Metaheuristics. Metaheuristics 2007: 297-322 - 2006
- [j3]Sebastián Urrutia, Celso C. Ribeiro:
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discret. Appl. Math. 154(13): 1932-1938 (2006) - [c4]Celso C. Ribeiro, Sebastián Urrutia:
Scheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives. PATAT 2006: 147-157 - [c3]Alexandre R. Duarte, Celso C. Ribeiro, Sebastián Urrutia, Edward Hermann Haeusler:
Referee Assignment in Sports Leagues. PATAT 2006: 158-173 - 2005
- [j2]Celso C. Ribeiro, Sebastián Urrutia:
An application of integer programming to playoff elimination in football championships. Int. Trans. Oper. Res. 12(4): 375-386 (2005) - [c2]Aletéia Patrícia Favacho de Araújo, Sebastián Urrutia:
Towards Grid Implementations of Metaheuristics for Hard Combinatorial Optimization Problems. SBAC-PAD 2005: 19-26 - 2004
- [j1]Sebastián Urrutia, Celso C. Ribeiro:
Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules. Electron. Notes Discret. Math. 18: 227-233 (2004) - 2001
- [c1]Sebastián Urrutia, Irene Loiseau:
A new metaheuristic and its application to the Steiner problems in graphs. SCCC 2001: 273-281
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-12-26 00:50 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:
