Marcus Ritt

Address:
Universidade Federal do Rio Grande do Sul
Instituto de Informática
Departamento de Informática Teórica
Av. Bento Gonçalves, 9500 - Campus do Vale - Bloco IV
Bairro Agronomia - Porto Alegre - RS - Brazil
CEP 91501-970
Email: mrpritt at inf.ufrgs.br
Tel: +55 (51) 3308-6818

Versão em português

I am an associate professor at the Departamento de Informática Teórica since 2006. I received a master's degree in computer science in 1997 from Eberhard-Karls-Universität in Tübingen and a PhD in computer science, summa cum laude, from Eberhard-Karls-Universität in Tübingen in 2003. My current interests are in exact, approximative and heuristic algorithms for combinatorial optimization problems. My official brazilian CV (Lattes) currículo has more details.

I am lecturing Combinatorial optimization, Advanced algorithms, and Heuristic search techniques, .

Previous semesters (in portuguese)

I am interested in algorithms and complexity (in particular with applications in bioinformatics), mathematical programming, optimization algorithms, parameterized algorithms and heuristics. I have been working with clusters and parallel computing (with applications in bioinformatics) and simulation of physical systems.

Students interested in “iniciação científica”, undergraduate and master's thesis, etc. in algorithms and optimization, please contact me. Our group's page (in portuguese) has more information.

You may also be interested in online supplements to my articles.

Alex Gliesch and Marcus Ritt. A hybrid heuristic for the maximum dispersion problem. Eur. J. Oper. Res., 2020. (doi:10.1016/j.ejor.2020.06.011)

Marcus Ritt and Jorge Pereira. Heuristic and exact algorithms for minimum-weight non-spanning arborescences. Eur. J. Oper. Res., 2020. (doi:10.1016/j.ejor.2020.03.073)

Wesley Kaizer, André Grahl, and Marcus Ritt. Sequencing operator counts with state-space search. In Proc. 30th Int. Conf. Autom. Plan. Sched., pages 166–174, 2017.

Alex Gliesch and Marcus Ritt. A generic approach to districting with diameter or center-based objectives. In Manuel López-Ibáñez, editor, Proc. 21th Conf. Genetic Evol. Comput., pages 249–257, Prague, 2019. ACM Press. (doi:10.1145/3321707.3321874)

Alexander Benavides and Marcus Ritt. Fast heuristics for minimizing the makespan in non-permutation flow shops. Comput. Oper. Res., 100:230–243, December 2018. (doi:10.1016/j.cor.2018.07.017)

Jordi Pereira, Marcus Ritt, and Oscar C. Vásquez. A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Int. J. Prod. Res., 99:249–261, November 2018. (doi:10.1016/j.cor.2018.07.001)

Leonardo Borba, Marcus Ritt, and Cristóbal Miralles. Exact and heuristic methods for solving the robotic assembly line balancing problem. Eur. J. Oper. Res., 270(1):146–156, 2018. (doi:10.1016/j.ejor.2018.03.011)

Artur F. Brum and Marcus Ritt. Automatic algorithm configuration for the permutation flow shop scheduling problem minimizing total flowtime. In Liefooghe and López-Ibáñez [Liefooghe and López-Ibáñez, 2018], pages 85–100. (doi:10.1007/978-3-319-77449-7_6)

Augusto Blaas Correa, André Grahl Pereira, and Marcus Ritt. Analyzing tie-breaking strategies for the A* algorithm. In Proceedings of the 27th International Joint Conference on Artificial Intelligence, pages 4715–4721, Stockholm, 2018. (PDF, 7 pages, 227818 bytes) (doi:10.24963/ijcai.2018/655)

Marcelo de Souza and Marcus Ritt. Automatic grammar-based design of heuristic algorithms for unconstrained binary quadratic programming. In Liefooghe and López-Ibáñez [Liefooghe and López-Ibáñez, 2018], pages 67–84. (doi:10.1007/978-3-319-77449-7_5)

Alex Gliesch, Marcus Ritt, and Mayron C. O. Moreira. A multistart alternating tabu search for commercial districting. In Liefooghe and López-Ibáñez [Liefooghe and López-Ibáñez, 2018], pages 158–173. (doi:10.1007/978-3-319-77449-7_11)

Jordi Pereira, Marcus Ritt, and Oscar C. Vásquez. A memetic algorithm for the cost-oriented robotic assembly line balancing problem. 2018. (doi:10.1016/j.cor.2018.07.001)

Tadeu Zubaran and Marcus Ritt. An effective heuristic algorithm for the partial shop scheduling problem. Comput. Oper. Res., 93:51–65, May 2018. Online supplement: http://inf.ufrgs.br/algopt/pssp. (doi:10.1016/j.cor.2018.01.015)

More...

A collection of libraries with instances of combinatorial optimization problems.

Is it winter, and you want to know “How to get up on cold mornings?” Here's the answer.

About theory and practice (in german)