Diferenças

Esta página mostra as diferenças entre as duas revisões da página.

--- homepage_en [2009/09/07 14:51]
marcus
+++ homepage_en [2020/07/20 21:46] (Actual)
@@ Linha 16: / Linha 16: @@
 {{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 adjunct 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://buscatextual.cnpq.br/buscatextual/visualizacv.jsp?id=P3009653&tipo=completo|currículo]] has more details.
+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 [[inf05508:homepage|Logic for computer science]], [[inf05010:homepage|Combinatorial optimization]], and [[inf05504:homepage|Advanced algorithms]].
+I am lecturing [[inf05010:homepage|Combinatorial optimization]], [[inf05504:homepage|Advanced algorithms]], and [[cmp268:homepage|Heuristic search techniques]], .
 [[Ensino|Previous semesters]] (in portuguese)
@@ Linha 47: / Linha 51: @@
 **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.
-===== More information  =====
-Have a look at [[http://www.inf.ufrgs.br/lagos09|Lagos 2009]]!
+===== Recent publications =====
-===== Publications =====
 <html>
-<!-- BEGIN BIBLIOGRAPHY ../eigenes -->
+<!-- Authors: Alex Gliesch and Marcus Ritt -->
-<!--
+<li><a name="Gliesch.Ritt/2020c"></a>Alex Gliesch and Marcus Ritt.
-    DO NOT MODIFY THIS BIBLIOGRAPHY BY HAND!  IT IS MAINTAINED AUTOMATICALLY!
+A hybrid heuristic for the maximum dispersion problem.
-    YOUR CHANGES WILL BE LOST THE NEXT TIME IT IS UPDATED!
+<cite>Eur. J. Oper. Res.</cite>, 2020.
--->
+<!-- PDF: Publications/J23.pdf -->
-<!-- Generated by: /home/ritt/arch/share/bin/bib2xhtml -c -r -i ../eigenes.bib publications.html -->
+(<a href="http://dx.doi.org/10.1016/j.ejor.2020.06.011">doi:10.1016/j.ejor.2020.06.011</a>)</li>
-<ul class="bib2xhtml">
-<!-- Authors: Edson Prestes Silva Júnior and Marcus Ritt and Gustavo Führ -->
+<!-- Authors: Marcus Ritt and Jorge Pereira -->
-<li><a name="Prestes.etal/2009">Edson</a> Prestes&nbsp;Silva Júnior, Marcus Ritt, and Gustavo
+<li><a name="Ritt.Pereira/2019"></a>Marcus Ritt and Jorge
-  Führ.
+  Pereira.
-An improved particle filter for sparse environments.
+Heuristic and exact algorithms for minimum-weight non-spanning arborescences.
-<cite>Journal of the Brazilian Computer Society</cite>, Accepted for
+<cite>Eur. J. Oper. Res.</cite>, 2020.
-  publication.
+<!-- PDF: Publications/J22.pdf -->
-Special Edition "Intelligent Robotic Systems".</li>
+(<a href="http://dx.doi.org/10.1016/j.ejor.2020.03.073">doi:10.1016/j.ejor.2020.03.073</a>)</li>
-<!-- Authors: Alexander Benavides and Mariane Siqueira Machado and Marcus Ritt
+<!-- Authors: Wesley Kaizer and André Grahl and Marcus Ritt -->
-  and Luciana S Buriol and Vinicius J Garcia and Paulo M França -->
+<li><a name="Kaizer.etal/2020"></a>Wesley Kaizer, André Grahl,
-<li><a name="Benavides.etal/2009">Alexander</a> Benavides, Mariane&nbsp;Siqueira Machado, Marcus Ritt,
+  and Marcus Ritt.
-  Luciana&nbsp;S. Buriol, Vinicius&nbsp;J. Garcia, and Paulo&nbsp;M. França.
+<a href="https://aaai.org/ojs/index.php/ICAPS/article/view/6658/6512">Sequencing
-A comparison of tabu search and a GRASP for the switch allocation problem.
+  operator counts with state-space search</a>.
-In <cite>Anais do XLI Simpósio Brasileiro de Pesquisa Operacional</cite>, Porto
+In <cite>Proc. 30th Int. Conf. Autom. Plan. Sched.</cite>, pages 166&ndash;174,
-  Seguro, 2009.
+.
-(<a href="./Publications/P22-sbpo-2009.pdf">PDF</a>, 12 pages, 176009 bytes)</li>
+<!-- PDF: Publications/P75-icaps2020.pdf --></li>
-<!-- Authors: Michael Hirsch and Panos Pardalos and Tania Querido and Mauricio
+<!-- Authors: Alex Gliesch and Marcus Ritt -->
-  Resende and Marcus Ritt -->
+<!-- Keywords: ufrgs2019 -->
-<li><a name="Hirsch.etal/2009">Michael</a>
+<li><a name="Gliesch.Ritt/2019"></a>Alex Gliesch and Marcus Ritt.
-  Hirsch, Panos Pardalos, Tania Querido, Mauricio Resende, and Marcus Ritt.
+A generic approach to districting with diameter or center-based objectives.
-A hybrid genetic algorithm for road congestion minimization.
+In Manuel López-Ibáñez, editor, <cite>Proc. 21th Conf. Genetic
-In <cite>Anais do XLI Simpósio Brasileiro de Pesquisa Operacional</cite>, Porto
+  Evol. Comput.</cite>, pages 249&ndash;257, Prague, 2019. ACM Press.
-  Seguro, 2009.
+<!-- PDF: Publications/P74.pdf -->
-(<a href="./Publications/P21-sbpo-2009.pdf">PDF</a>, 12 pages, 133211 bytes)</li>
+(<a href="http://dx.doi.org/10.1145/3321707.3321874">doi:10.1145/3321707.3321874</a>)</li>
-<!-- Authors: Gabriel Portal and Rafael Rocco and Marcus Ritt and Luciana S
+<!-- Authors: Alexander Benavides and Marcus Ritt -->
-  Buriol -->
+<!-- Keywords: pq2016result -->
-<li><a name="Portal.etal/2009">Gabriel</a>
+<li><a name="Benavides.Ritt/2018"></a>Alexander Benavides and Marcus
-  Portal, Rafael Rocco, Marcus Ritt, and Luciana&nbsp;S. Buriol.
+  Ritt.
-Uma busca tabu aplicada ao problema de roteamento com restrições de
+Fast heuristics for minimizing the makespan in non-permutation flow shops.
-  empacotamento tridimensionais.
+<cite>Comput. Oper. Res.</cite>, 100:230&ndash;243, December 2018.
-In <cite>Anais do XLI Simpósio Brasileiro de Pesquisa Operacional</cite>, Porto
+<!-- PDF: Publications/J21.pdf -->
-  Seguro, 2009.
+(<a href="http://dx.doi.org/10.1016/j.cor.2018.07.017">doi:10.1016/j.cor.2018.07.017</a>)</li>
-(<a href="./Publications/P20-sbpo-2009.pdf">PDF</a>, 10 pages, 153560 bytes)</li>
-<!-- Authors: Marcus Ritt and Luciana S Buriol -->
+<!-- Authors: Jordi Pereira and Marcus Ritt and Oscar C Vásquez -->
-<li><a name="Ritt.Buriol/2009">Marcus</a> Ritt
+<!-- Keywords: pq2016result -->
-  and Luciana&nbsp;S. Buriol.
+<li><a name="Pereira.etal/2018"></a>Jordi Pereira, Marcus Ritt,
-Desafios algorítmicos no processamento de grandes volumes de dados.
+  and Oscar&nbsp;C. Vásquez.
-In <cite>XXXVI Seminário Integrado de Software e Hardware (SEMISH)</cite>,
+A memetic algorithm for the cost-oriented robotic assembly line balancing
-  Bento Gonçalves, 2009.
+  problem.
-(<a href="./Publications/P23-semish-2009.pdf">PDF</a>, 15 pages, 228020 bytes)</li>
+<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: Marcus Ritt and Alysson M Costa and Viviane M Orengo and Sergio
-  Mergen -->
-<li><a name="Ritt.etal/2009">Marcus</a> Ritt,
-  Alysson&nbsp;M. Costa, Viviane&nbsp;M. Orengo, and Sergio Mergen.
-An integer linear programming approach for approximate string comparison.
-<cite>European Journal of Operational Research</cite>, 198(3):706&ndash;714, 2009.
-(<a href="./Publications/P19-ejor-2009.pdf">PDF</a>, 20 pages, 276334 bytes)
-(<a href="http://dx.doi.org/10.1016/j.ejor.2008.10.013">doi:10.1016/j.ejor.2008.10.013</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,
+]</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,
+]</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,
+]</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.
+.
+(<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...]]
@@ Linha 132: / Linha 195: @@
 A [[metalibrary|collection of libraries]] with instances of combinatorial optimization problems.
-It's winter, and you're asking yourself "How to get up on cold mornings?"
+Is it winter, and you want to know "How to get up on cold mornings?"
 [[gettingup|Here's the answer.]]\\
@@ Linha 141: / Linha 204: @@
 About [[teoria e pratica|theory and practice]] (in german)

Marcus Ritt

Ferramentas de Utilizador

Ferramentas de Site

Diferenças

Ferramentas de Página