Marcus Ritt

Esta página é apenas de leitura. Pode ver a fonte, mas não alterá-la. Informe-se com o administrador deste Wiki se achar que isto não está correcto.
====== 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**: <html><a href='javascript:feel("231 760 157 760 946 603 603 235 946 507 881 1015 382 881 760 179 628 1015 724 760",1159,463)'> mrpritt at inf.ufrgs.br </a> </html>\\
**Tel**: +55 (51) 3308-6818


{{pb.png}}[[homepage|Versão em português]]

<html>
<!--
**[[concurso|Full-time faculty position (professor adjunto) in Algorithms and computability]]**

**[[concurso|Full-time faculty position (professor adjunto) in Bioinformatics and graph theory]]**
-->
</html>


=====  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 =====

<html>
<!-- Authors: Alex Gliesch and Marcus Ritt -->
<li><a name="Gliesch.Ritt/2020c"></a>Alex Gliesch and Marcus Ritt.
A hybrid heuristic for the maximum dispersion problem.
<cite>Eur. J. Oper. Res.</cite>, 2020.
<!-- PDF: Publications/J23.pdf -->
(<a href="http://dx.doi.org/10.1016/j.ejor.2020.06.011">doi:10.1016/j.ejor.2020.06.011</a>)</li>

<!-- Authors: Marcus Ritt and Jorge Pereira -->
<li><a name="Ritt.Pereira/2019"></a>Marcus Ritt and Jorge
  Pereira.
Heuristic and exact algorithms for minimum-weight non-spanning arborescences.
<cite>Eur. J. Oper. Res.</cite>, 2020.
<!-- PDF: Publications/J22.pdf -->
(<a href="http://dx.doi.org/10.1016/j.ejor.2020.03.073">doi:10.1016/j.ejor.2020.03.073</a>)</li>

<!-- Authors: Wesley Kaizer and André Grahl and Marcus Ritt -->
<li><a name="Kaizer.etal/2020"></a>Wesley Kaizer, André Grahl,
  and Marcus Ritt.
<a href="https://aaai.org/ojs/index.php/ICAPS/article/view/6658/6512">Sequencing
  operator counts with state-space search</a>.
In <cite>Proc. 30th Int. Conf. Autom. Plan. Sched.</cite>, pages 166&ndash;174,
  2017.
<!-- PDF: Publications/P75-icaps2020.pdf --></li>

<!-- Authors: Alex Gliesch and Marcus Ritt -->
<!-- Keywords: ufrgs2019 -->
<li><a name="Gliesch.Ritt/2019"></a>Alex Gliesch and Marcus Ritt.
A generic approach to districting with diameter or center-based objectives.
In Manuel López-Ibáñez, editor, <cite>Proc. 21th Conf. Genetic
  Evol. Comput.</cite>, pages 249&ndash;257, Prague, 2019. ACM Press.
<!-- PDF: Publications/P74.pdf -->
(<a href="http://dx.doi.org/10.1145/3321707.3321874">doi:10.1145/3321707.3321874</a>)</li>

<!-- Authors: Alexander Benavides and Marcus Ritt -->
<!-- Keywords: pq2016result -->
<li><a name="Benavides.Ritt/2018"></a>Alexander Benavides and Marcus
  Ritt.
Fast heuristics for minimizing the makespan in non-permutation flow shops.
<cite>Comput. Oper. Res.</cite>, 100:230&ndash;243, December 2018.
<!-- PDF: Publications/J21.pdf -->
(<a href="http://dx.doi.org/10.1016/j.cor.2018.07.017">doi:10.1016/j.cor.2018.07.017</a>)</li>

<!-- Authors: Jordi Pereira and Marcus Ritt and Oscar C Vásquez -->
<!-- Keywords: pq2016result -->
<li><a name="Pereira.etal/2018"></a>Jordi Pereira, Marcus Ritt,
  and Oscar&nbsp;C. Vásquez.
A memetic algorithm for the cost-oriented robotic assembly line balancing
  problem.
<cite>Int. J. Prod. Res.</cite>, 99:249&ndash;261, November 2018.
<!-- PDF: Publications/J20.pdf -->
(<a href="http://dx.doi.org/10.1016/j.cor.2018.07.001">doi:10.1016/j.cor.2018.07.001</a>)</li>


<!-- Authors: Leonardo Borba and Marcus Ritt and Cristóbal Miralles -->
<li><a name="Borba.etal/2018"></a>Leonardo Borba, Marcus Ritt,
  and Cristóbal Miralles.
Exact and heuristic methods for solving the robotic assembly line balancing
  problem.
<cite>Eur. J. Oper. Res.</cite>, 270(1):146&ndash;156, 2018.
<!-- PDF: Publications/J19.pdf -->
(<a href="http://dx.doi.org/10.1016/j.ejor.2018.03.011">doi:10.1016/j.ejor.2018.03.011</a>)</li>

<!-- Authors: Artur F Brum and Marcus Ritt -->
<!-- Keywords: fssp -->
<li><a name="Brum.Ritt/2018"></a>Artur&nbsp;F. Brum and Marcus
  Ritt.
Automatic algorithm configuration for the permutation flow shop scheduling
  problem minimizing total flowtime.
In <a href="#evocop2018">Liefooghe and López-Ibáñez</a> <a href="#evocop2018">[Liefooghe and López-Ibáñez,
  2018]</a>,
  pages 85&ndash;100.
<!-- PDF: Publications/P67.pdf -->
(<a href="http://dx.doi.org/10.1007/978-3-319-77449-7_6">doi:10.1007/978-3-319-77449-7_6</a>)</li>

<!-- Authors: Augusto Blaas Correa and André Grahl Pereira and Marcus Ritt -->
<li><a name="Correa.etal/2018b"></a>Augusto&nbsp;Blaas Correa,
  André&nbsp;Grahl Pereira, and Marcus Ritt.
Analyzing tie-breaking strategies for the A* algorithm.
In <cite>Proceedings of the 27th International Joint Conference on Artificial
  Intelligence</cite>, pages 4715&ndash;4721, Stockholm, 2018.
(<a href="./Publications/P71-ijcai2018.pdf">PDF</a>, 7 pages, 227818 bytes)
(<a href="http://dx.doi.org/10.24963/ijcai.2018/655">doi:10.24963/ijcai.2018/655</a>)</li>

<!-- Authors: Marcelo de Souza and Marcus Ritt -->
<li><a name="Souza.Ritt/2018"></a>Marcelo de&nbsp;Souza and Marcus
  Ritt.
Automatic grammar-based design of heuristic algorithms for unconstrained binary
  quadratic programming.
In <a href="#evocop2018">Liefooghe and López-Ibáñez</a> <a href="#evocop2018">[Liefooghe and López-Ibáñez,
  2018]</a>,
  pages 67&ndash;84.
<!-- PDF: Publications/P65.pdf -->
(<a href="http://dx.doi.org/10.1007/978-3-319-77449-7_5">doi:10.1007/978-3-319-77449-7_5</a>)</li>

<!-- Authors: Alex Gliesch and Marcus Ritt and Mayron C O Moreira -->
<!-- Keywords: cv -->
<li><a name="Gliesch.etal/2018"></a>Alex Gliesch, Marcus Ritt,
  and Mayron C.&nbsp;O. Moreira.
A multistart alternating tabu search for commercial districting.
In <a href="#evocop2018">Liefooghe and López-Ibáñez</a> <a href="#evocop2018">[Liefooghe and López-Ibáñez,
  2018]</a>,
  pages 158&ndash;173.
<!-- PDF: Publications/P66.pdf -->
(<a href="http://dx.doi.org/10.1007/978-3-319-77449-7_11">doi:10.1007/978-3-319-77449-7_11</a>)</li>

<!-- Authors: Jordi Pereira and Marcus Ritt and Oscar C Vásquez -->
<li><a name="Pereira.etal/2018"></a>Jordi Pereira, Marcus Ritt,
  and Oscar&nbsp;C. Vásquez.
A memetic algorithm for the cost-oriented robotic assembly line balancing
  problem.
2018.
(<a href="http://dx.doi.org/10.1016/j.cor.2018.07.001">doi:10.1016/j.cor.2018.07.001</a>)</li>

<!-- Authors: Tadeu Zubaran and Marcus Ritt -->
<!-- Keywords: fssp,jssp,pssp -->
<li><a name="Zubaran.Ritt/2017"></a>Tadeu Zubaran and Marcus
  Ritt.
An effective heuristic algorithm for the partial shop scheduling problem.
<cite>Comput. Oper. Res.</cite>, 93:51&ndash;65, May 2018.
Online supplement: <a href="http://inf.ufrgs.br/algopt/pssp">http://inf.ufrgs.br/algopt/pssp</a>.
<!-- PDF: Publications/J18.pdf -->
(<a href="http://dx.doi.org/10.1016/j.cor.2018.01.015">doi:10.1016/j.cor.2018.01.015</a>)</li>
</html>


[[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.]]\\

<html>
<a href="http://www2.clustrmaps.com/counter/maps.php?url=http://www.inf.ufrgs.br/~mrpritt" id="clustrMapsLink"><img src="http://www2.clustrmaps.com/counter/index2.php?url=http://www.inf.ufrgs.br/~mrpritt" style="border:1px solid;" alt="Locations of visitors to this page" title="Locations of visitors to this page" id="clustrMapsImg" onError="this.onError=null; this.src='http://clustrmaps.com/images/clustrmaps-back-soon.jpg'; document.getElementById('clustrMapsLink').href='http://clustrmaps.com'" />
</a>
</html>

About [[teoria e pratica|theory and practice]] (in german)
Marcus Ritt

Ferramentas de Utilizador

Ferramentas de Site

Ferramentas de Página
