Sebastián Urrutia

Orcid: 0000-0002-7561-6825

Affiliations:
  • Federal University of Minas Gerais, Belo Horizonte, Brazil


According to our database1, Sebastián Urrutia authored at least 59 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The nilcatenation problem and its application for detecting money laundering activities in cryptocurrency networks.
Int. Trans. Oper. Res., November, 2024

Polynomial time algorithms for the token swapping problem on cographs.
RAIRO Oper. Res., January, 2024

On the computational complexity of the strong geodetic recognition problem.
RAIRO Oper. Res., 2024

Finding the Minimum Cost Acceptable Element in a Sorted Matrix.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

2023
A tutorial on graph models for scheduling round-robin sports tournaments.
Int. Trans. Oper. Res., November, 2023

Maritime inventory routing: recent trends and future directions.
Int. Trans. Oper. Res., November, 2023

2022
Branch-and-cut algorithms for the -arborescence star problem.
Int. Trans. Oper. Res., 2022

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Eur. J. Oper. Res., 2022

Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil.
Discret. Appl. Math., 2022

On the arboreal jump number of a poset.
CoRR, 2022

2021
Recoloring subgraphs of <i>K</i><sub>2<i>n</i></sub> for sports scheduling.
Theor. Comput. Sci., 2021

Delayed improvement local search.
J. Heuristics, 2021

Extended high dimensional indexing approach for reachability queries on very large graphs.
Expert Syst. Appl., 2021

The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints.
Proceedings of the XLVII Latin American Computing Conference, 2021

2020
Gamma deployment problem in grids: hardness and new integer linear programming formulation.
Int. Trans. Oper. Res., 2020

Load-dependent speed optimization in maritime inventory routing.
Comput. Oper. Res., 2020

2019
One-Sided Weak Dominance Drawing.
Theor. Comput. Sci., 2019

Preface.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The matching relaxation for a class of generalized set partitioning problems.
Discret. Appl. Math., 2019

2018
Special issue on "Developments in Optimization for Smart Cities".
Int. Trans. Oper. Res., 2018

What are the worst cases in constrained Last-In-First-Out pick-up and delivery problems?
Eur. J. Oper. Res., 2018

Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks.
Comput. Oper. Res., 2018

Profit Maximization in Inventory Routing Problems.
Proceedings of the 2018 IEEE International Conference on Industrial Engineering and Engineering Management, 2018

2017
New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Int. Trans. Oper. Res., 2017

2016
Edge coloring: A natural model for sports scheduling.
Eur. J. Oper. Res., 2016

Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems.
Electron. Notes Discret. Math., 2016

Sports scheduling search space connectivity: A riffle shuffle driven approach.
Discret. Appl. Math., 2016

A Decomposition Approach to Solve The Quay Crane Scheduling Problem.
CoRR, 2016

A combinatorial relaxation methodology for berth allocation problems.
CoRR, 2016

A new neighborhood structure for round robin scheduling problems.
Comput. Oper. Res., 2016

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices.
Comput. Optim. Appl., 2016

2015
A branch and cut algorithm for minimum spanning trees under conflict constraints.
Optim. Lett., 2015

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks.
Int. Trans. Oper. Res., 2015

On the maximum acyclic subgraph problem under disjunctive constraints.
Inf. Process. Lett., 2015

Erratum to "Characterizing acyclic graphs by labeling edges" [Discrete Appl. Math. 164 (2014) 492-499].
Discret. Appl. Math., 2015

2014
Characterizing acyclic graphs by labeling edges.
Discret. Appl. Math., 2014

2013
Role Assignment in Wireless Sensor Networks Based on Vertex Coloring.
Proceedings of the Seventh IEEE International Symposium on Service-Oriented System Engineering, 2013

2012
Scheduling the Brazilian Soccer Tournament: Solution Approach and Practice.
Interfaces, 2012

An ILS heuristic for the traveling tournament problem with predefined venues.
Ann. Oper. Res., 2012

Designing a Multicore Graph Library.
Proceedings of the 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, 2012

2011
A New Formulation for Spanning Trees.
Electron. Notes Discret. Math., 2011

2010
Discrete optimization methods to determine trajectories for Dubins' vehicles.
Electron. Notes Discret. Math., 2010

A General VNS heuristic for the traveling salesman problem with time windows.
Discret. Optim., 2010

Scheduling in sports: An annotated bibliography.
Comput. Oper. Res., 2010

2009
The traveling tournament problem with predefined venues.
J. Sched., 2009

2008
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments.
Int. Trans. Oper. Res., 2008

A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints.
Eur. J. Oper. Res., 2008

An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem.
Eur. J. Oper. Res., 2008

2007
Heuristics for the mirrored traveling tournament problem.
Eur. J. Oper. Res., 2007

A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

A New Lower Bound to the Traveling Tournament Problem.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

Exploring Grid Implementations of Parallel Cooperative Metaheuristics.
Proceedings of the Metaheuristics, 2007

2006
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem.
Discret. Appl. Math., 2006

Scheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

Referee Assignment in Sports Leagues.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2005
An application of integer programming to playoff elimination in football championships.
Int. Trans. Oper. Res., 2005

Towards Grid Implementations of Metaheuristics for Hard Combinatorial Optimization Problems.
Proceedings of the 17th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2005), 2005

2004
Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules.
Electron. Notes Discret. Math., 2004

2001
A new metaheuristic and its application to the Steiner problems in graphs.
Proceedings of the 21st International Conference of the Chilean Computer Science Society (SCCC 2001), 2001


  Loading...