====== Marcus Ritt ====== {{marcus.jpg |Marcus Ritt}} **Address:**\\ [[http:///www.ufrgs.br|Universidade Federal do Rio Grande do Sul]]\\ [[http://www.inf.ufrgs.br|Instituto de Informática]]\\ [[http://si3.inf.ufrgs.br/HomePage/info/membro.cfm?CodComissao=4|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 {{pb.png}}[[homepage|Versão em português]] ===== About me ===== 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 [[http://www.uni-tuebingen.de|Eberhard-Karls-Universität in Tübingen]] and a PhD in computer science, summa cum laude, from [[http://www.uni-tuebingen.de|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) [[http://lattes.cnpq.br/0994187406222820|currículo]] has more details. ===== Teaching ===== I am lecturing [[inf05010:homepage|Combinatorial optimization]], [[inf05504:homepage|Advanced algorithms]], and [[cmp268:homepage|Heuristic search techniques]], . [[Ensino|Previous semesters]] (in portuguese) ===== Research ===== I am interested in [[algorítmos|algorithms and complexity]] (in particular with applications in [[bioinf:bioinformática|bioinformatics]]), mathematical programming, optimization algorithms, parameterized algorithms and heuristics. I have been working with [[http://web.archive.org/web/20071204070834/http://kepler.sfb382-zdv.uni-tuebingen.de/kepler/index.shtml|clusters]] and [[http://www-ti.informatik.uni-tuebingen.de/~c6|parallel computing]] (with [[http://www-pr.informatik.uni-tuebingen.de/parseq|applications]] in bioinformatics) and [[http://www-ti.informatik.uni-tuebingen.de/~ganzenmu/sph2000/1k.r.gif|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 [[algorítmos|group's page]] (in portuguese) has more information. You may also be interested in [[Online supplements|online supplements]] to my articles. ===== Recent publications =====
  • 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)
    • [[publications|More...]] ===== Miscellaneous ===== A [[metalibrary|collection of libraries]] with instances of combinatorial optimization problems. Is it winter, and you want to know "How to get up on cold mornings?" [[gettingup|Here's the answer.]]\\ Locations of visitors to this page About [[teoria e pratica|theory and practice]] (in german)