Marcus Ritt

Ferramentas de Utilizador

Ferramentas de Site

Está em: • homepage_en

Barra Lateral

Índice

homepage_en

Esta é uma versão antiga do documento!

Tabela de Conteúdos

Marcus Ritt

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

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

Teaching

I am lecturing Logic for computer science, Combinatorial optimization, and Advanced algorithms.

Previous semesters (in portuguese)

Research

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.

Publications

  • Alexander J. Benavides, Marcus Ritt, and Cristóbal Miralles. Flow shop scheduling with heterogeneous workers. Eur. J. Oper. Res., 2014. In press, corrected proof. (doi:10.1016/j.ejor.2014.02.012)
  • Leonardo M. Borba and Marcus Ritt. A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem. Comput. Oper. Res., 45:87–96, May 2014. (doi:10.1016/j.cor.2013.12.002)
  • Leonardo M. Borba, Alexander J. Benavides, Tadeu K. Zubaran, Germano C. Carniel, and Marcus Ritt. A simple stochastic local search for multi-mode resource-constrained multi-project scheduling. In Proc. Multidisc. Int. Sched. Conf. (MISTA), 2013. (PDF, 189073 bytes)
  • Germano C. Carniel, Alexander J. Benavides, and Marcus Ritt. Models for the inclusion of workers with disabilities in flow shop scheduling problems. In Anais do XLV Simpósio Brasileiro de Pesquisa Operacional [sbp, 2013]. (PDF, 668523 bytes)
  • André Grahl Pereira, Marcus Ritt, and Luciana S. Buriol. Finding optimal solutions to Sokoban using instance dependent pattern databases. In Helmert and Röger Proceedings of The Sixth International Symposium on Combinatorial Search. (PDF, 657990 bytes)
  • Leonardo Steinfeld, Marcus Ritt, Fernando Silveira, and Luigi Carro. Low-power processors require effective memory partitioning. In International Embedded Systems Symposium, pages 73–81, 2013. (doi:10.1007/978-3-642-38853-8_7)
  • Leonardo Steinfeld, Marcus Ritt, Fernando Silveira, and Luigi Carro. A new memory banking system for energy-efficient wireless sensor networks. In 9th IEEE International Conference on Distributed Computing in Sensor Systems, pages 73–81, 2013. (PDF, 7 pages, 265171 bytes)
  • Tadeu K. Zubaran and Marcus Ritt. A simple, adaptive bubble search for improving heuristic solutions of the permutation flow shop scheduling problem. In Anais do XLV Simpósio Brasileiro de Pesquisa Operacional . (PDF, 658160 bytes)

    • More...

    Miscellaneous

    A 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?” Here's the answer.

    Locations of visitors to this page

    About theory and practice (in german)

    homepage_en.1437486911.txt.gz · Esta página foi modificada pela última vez em: 2015/07/21 10:55 por marcus

    Ferramentas de Página

    Excepto menção em contrário, o conteúdo neste wiki está sob a seguinte licença: CC Attribution-Noncommercial-Share Alike 4.0 International
    CC Attribution-Noncommercial-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki