Diferenças

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

--- homepage_en [2014/07/04 09:47]
marcus [Miscellaneous]
+++ homepage_en [2020/07/20 21:46] (Actual)
@@ Linha 27: / Linha 27: @@
 =====  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 51: / 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.
-===== Publications =====
+===== Recent publications =====
 <html>
-<!-- Authors: Alexander J Benavides and Marcus Ritt and Cristobal
+<!-- Authors: Alex Gliesch and Marcus Ritt -->
-Miralles -->
+<li><a name="Gliesch.Ritt/2020c"></a>Alex Gliesch and Marcus Ritt.
-<li><a name="Benavides.etal/2014"></a>Alexander&nbsp;J. Benavides,
+A hybrid heuristic for the maximum dispersion problem.
-  Marcus Ritt, and Crist&oacute;bal Miralles.  Flow shop scheduling
+<cite>Eur. J. Oper. Res.</cite>, 2020.
-  with heterogeneous workers.
+<!-- PDF: Publications/J23.pdf -->
-<cite>Eur. J. Oper. Res.</cite>, 2014.  In press, corrected proof.
+(<a href="http://dx.doi.org/10.1016/j.ejor.2020.06.011">doi:10.1016/j.ejor.2020.06.011</a>)</li>
-(<a href="http://dx.doi.org/10.1016/j.ejor.2014.02.012">doi:10.1016/j.ejor.2014.02.012</a>)</li>
-<!-- Authors: Leonardo M Borba and Marcus Ritt -->
+<!-- Authors: Marcus Ritt and Jorge Pereira -->
-<li><a name="Borba.Ritt/2014"></a>Leonardo&nbsp;M. Borba and Marcus
+<li><a name="Ritt.Pereira/2019"></a>Marcus Ritt and Jorge
-  Ritt.  A heuristic and a branch-and-bound algorithm for the assembly
+  Pereira.
-  line worker assignment and balancing problem.
+Heuristic and exact algorithms for minimum-weight non-spanning arborescences.
-<cite>Comput. Oper. Res.</cite>, 45:87&ndash;96, May 2014.
+<cite>Eur. J. Oper. Res.</cite>, 2020.
-(<a href="http://dx.doi.org/10.1016/j.cor.2013.12.002">doi:10.1016/j.cor.2013.12.002</a>)</li>
+<!-- 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: Leonardo M Borba and Alexander J Benavides and Tadeu K
+<!-- Authors: Wesley Kaizer and André Grahl and Marcus Ritt -->
-  Zubaran and Germano C Carniel and Marcus Ritt -->
+<li><a name="Kaizer.etal/2020"></a>Wesley Kaizer, André Grahl,
-<li><a name="Borba.etal/2013"></a>Leonardo&nbsp;M. Borba,
+  and Marcus Ritt.
-  Alexander&nbsp;J. Benavides, Tadeu&nbsp;K. Zubaran,
+<a href="https://aaai.org/ojs/index.php/ICAPS/article/view/6658/6512">Sequencing
-  Germano&nbsp;C. Carniel, and Marcus Ritt.  A simple stochastic local
+  operator counts with state-space search</a>.
-  search for multi-mode resource-constrained multi-project scheduling.
+In <cite>Proc. 30th Int. Conf. Autom. Plan. Sched.</cite>, pages 166&ndash;174,
-  In <cite>Proc.&nbsp;Multidisc.&nbsp;Int.&nbsp;Sched.&nbsp;Conf. (MISTA)</cite>,
+.
-.  (<a href="./Publications/R06-mista2013.pdf">PDF</a>, 189073
+<!-- PDF: Publications/P75-icaps2020.pdf --></li>
-  bytes)</li>
-<!-- Authors: Germano C Carniel and Alexander J Benavides and Marcus
+<!-- Authors: Alex Gliesch and Marcus Ritt -->
-Ritt -->
+<!-- Keywords: ufrgs2019 -->
-<li><a name="Carniel.Ritt/2013"></a>Germano&nbsp;C. Carniel,
+<li><a name="Gliesch.Ritt/2019"></a>Alex Gliesch and Marcus Ritt.
-  Alexander&nbsp;J. Benavides, and Marcus Ritt.
+A generic approach to districting with diameter or center-based objectives.
-<a href="http://www.din.uem.br/sbpo/sbpo2013">Models for the inclusion
+In Manuel López-Ibáñez, editor, <cite>Proc. 21th Conf. Genetic
-  of workers with disabilities in flow shop scheduling problems</a>.
+  Evol. Comput.</cite>, pages 249&ndash;257, Prague, 2019. ACM Press.
-  In <a href="#sbpo2013"><cite>Anais do XLV Simp&oacute;sio Brasileiro
+<!-- PDF: Publications/P74.pdf -->
-  de Pesquisa Operacional</cite></a> <a href="#sbpo2013">[sbp,
+(<a href="http://dx.doi.org/10.1145/3321707.3321874">doi:10.1145/3321707.3321874</a>)</li>
-]</a>.  (<a href="./Publications/P47-sbpo2013.pdf">PDF</a>,
-bytes)</li>
-<!-- Authors: Andre Grahl Pereira and Marcus Ritt and Luciana S Buriol
+<!-- Authors: Alexander Benavides and Marcus Ritt -->
--->
+<!-- Keywords: pq2016result -->
-<li><a name="Grahl.etal"></a>Andr&eacute;&nbsp;Grahl Pereira, Marcus
+<li><a name="Benavides.Ritt/2018"></a>Alexander Benavides and Marcus
-  Ritt, and Luciana&nbsp;S. Buriol.  Finding optimal solutions to
+  Ritt.
-  Sokoban using instance dependent pattern databases.
+Fast heuristics for minimizing the makespan in non-permutation flow shops.
-  In <a href="#socs2013">Helmert and
+<cite>Comput. Oper. Res.</cite>, 100:230&ndash;243, December 2018.
-  R&ouml;ger</a> <a href="#socs2013">Proceedings of The Sixth International Symposium on Combinatorial Search</a>.
+<!-- PDF: Publications/J21.pdf -->
-  (<a href="./Publications/P48-socs2013.pdf">PDF</a>, 657990
+(<a href="http://dx.doi.org/10.1016/j.cor.2018.07.017">doi:10.1016/j.cor.2018.07.017</a>)</li>
-  bytes)</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 Steinfeld and Marcus Ritt and Fernando Silveira
-  and Luigi Carro -->
-<li><a name="Steinfeld.etal/2013a"></a>Leonardo Steinfeld, Marcus
-  Ritt, Fernando Silveira, and Luigi Carro.  Low-power processors
-  require effective memory partitioning.  In <cite>International
-  Embedded Systems Symposium</cite>, pages 73&ndash;81, 2013.
-  <!-- PDF: Publications/P44-iess2013.pdf -->
-  (<a href="http://dx.doi.org/10.1007/978-3-642-38853-8_7">doi:10.1007/978-3-642-38853-8_7</a>)</li>
-<!-- Authors: Leonardo Steinfeld and Marcus Ritt and Fernando Silveira
+<!-- Authors: Leonardo Borba and Marcus Ritt and Cristóbal Miralles -->
-  and Luigi Carro -->
+<li><a name="Borba.etal/2018"></a>Leonardo Borba, Marcus Ritt,
-<li><a name="Steinfeld.etal/2013b"></a>Leonardo Steinfeld, Marcus
+  and Cristóbal Miralles.
-  Ritt, Fernando Silveira, and Luigi Carro.  A new memory banking
+Exact and heuristic methods for solving the robotic assembly line balancing
-  system for energy-efficient wireless sensor networks.  In <cite>9th
+  problem.
-  IEEE International Conference on Distributed Computing in Sensor
+<cite>Eur. J. Oper. Res.</cite>, 270(1):146&ndash;156, 2018.
-  Systems</cite>, pages 73&ndash;81, 2013.
+<!-- PDF: Publications/J19.pdf -->
-  (<a href="./Publications/P45-dcoss2013.pdf">PDF</a>, 7 pages, 265171
+(<a href="http://dx.doi.org/10.1016/j.ejor.2018.03.011">doi:10.1016/j.ejor.2018.03.011</a>)</li>
-  bytes)</li>
-<!-- Authors: Tadeu K Zubaran and Marcus Ritt -->
+<!-- Authors: Artur F Brum and Marcus Ritt -->
-<li><a name="Zubaran.Ritt/2013"></a>Tadeu&nbsp;K. Zubaran and Marcus
+<!-- Keywords: fssp -->
+<li><a name="Brum.Ritt/2018"></a>Artur&nbsp;F. Brum and Marcus
   Ritt.
-<a href="http://www.din.uem.br/sbpo/sbpo2013">A simple, adaptive
+Automatic algorithm configuration for the permutation flow shop scheduling
-  bubble search for improving heuristic solutions of the permutation
+  problem minimizing total flowtime.
-  flow shop scheduling problem</a>.
+In <a href="#evocop2018">Liefooghe and López-Ibáñez</a> <a href="#evocop2018">[Liefooghe and López-Ibáñez,
-  In <a href="#sbpo2013"><cite>Anais do XLV Simp&oacute;sio Brasileiro
+]</a>,
-  de Pesquisa Operacional</cite></a> .  (<a href="./Publications/P46-sbpo2013.pdf">PDF</a>,
+  pages 85&ndash;100.
-bytes)</li>
+<!-- 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>
@@ Linha 147: / Linha 195: @@
 A [[metalibrary|collection of libraries]] with instances of combinatorial optimization problems.
-Is it winter, and you're want to know "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 156: / 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