Marcus Ritt

* Marcus Ritt. Eine objektorientierte Kommunikationsbibliothek zur parallelen Programmierung â€“ TPO++. PhD thesis, UniversitÃ¤t TÃƒÂ¼bingen, July 2003

Instituto de Inform ´|Universidade Federal do Rio|Grande do Sul

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers74 papers

Sort

By YearBy Citation

A Hybrid Heuristic for the Maximum Dispersion Problem

Alex Gliesch,Marcus Ritt

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, no. 3 (2021): 721-735

EIBibtex

Heuristic and exact algorithms for minimum-weight non-spanning arborescences

Marcus Ritt,Jordi Pereira

European Journal of Operational Research, no. 1 (2020): 61-75

EIBibtex

A heuristic algorithm for districting problems with similarity constraints

Alex Gliesch,Marcus Ritt, Arthur H. S. Cruz,Mayron César O. Moreira

CEC, pp.1-8, (2020)

EIBibtex

A hybrid heuristic for districting problems with routing criteria

Alex Gliesch,Marcus Ritt, Arthur H. S. Cruz,Mayron César O. Moreira

CEC, pp.1-9, (2020)

EIBibtex

Sequencing Operator Counts with State-Space Search

Wesley L. Kaizer, André Grahl Pereira,Marcus Ritt

ICAPS, pp.166-174, (2020)

EIBibtex

A generic approach to districting with diameter or center-based objectives

Alex Gliesch,Marcus Ritt

GECCO, pp.249-257, (2019)

EIBibtex

Evolving task priority rules for heterogeneous assembly line balancing

João Pedro Gonçalves Moreira,Marcus Ritt

CEC, pp.1423-1430, (2019)

Cited by1EIBibtex

Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem

Leonardo Borba,Marcus Ritt,Cristóbal Miralles

European Journal of Operational Research, no. 1 (2018): 146-156

Cited by3EIBibtex

A memetic algorithm for the cost-oriented robotic assembly line balancing problem

Jordi Pereira,Marcus Ritt,Óscar C. Vásquez

Computers & Operations Research, (2018): 249-261

Cited by1EIBibtex

Fast heuristics for minimizing the makespan in non-permutation flow shops

Alexander J. Benavides,Marcus Ritt

Computers & Operations Research, (2018): 230-243

EIBibtex

Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming

Marcelo de Souza,Marcus Ritt

Lecture Notes in Computer Science, (2018): 67-84

EIBibtex

A Multistart Alternating Tabu Search for Commercial Districting

Alex Gliesch,Marcus Ritt,Mayron César O. Moreira

Lecture Notes in Computer Science, (2018): 158-173

EIBibtex

Analyzing Tie-Breaking Strategies for the A* Algorithm

Augusto B. Corrêa,André Grahl Pereira,Marcus Ritt

IJCAI, pp.4715-4721, (2018)

Cited by3EIBibtex

Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time

Artur Brum,Marcus Ritt

Lecture Notes in Computer Science, (2018): 85-100

EIBibtex

Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops

Artur Brum,Marcus Ritt

CEC, pp.1-8, (2018)

EIBibtex

An effective tabu search for job shop scheduling with parallel machines

Tadeu K. Zubaran,Marcus R. P. Ritt

CASE, pp.913-919, (2018)

EIBibtex

An Automatically Designed Recombination Heuristic for the Test-Assignment Problem

Marcelo de Souza,Marcus Ritt

CEC, pp.1-8, (2018)

EIBibtex

An effective heuristic algorithm for the partial shop scheduling problem

Tadeu K. Zubaran,Marcus Ritt

Computers & Operations Research, (2018): 51-65

EIBibtex

An iterated tabu search for the multi-compartment vehicle routing problem

Paulo Vitor Silvestrin,Marcus Ritt

Computers & OR, no. C (2017): 192-202

Cited by4EIBibtex

On the minimization of traffic congestion in road networks with tolls

Francieli M Stefanello,Luciana S Buriol,Michael J Hirsch,Panos M Pardalos,Tania Querido,Mauricio G C Resende,Marcus Ritt

Annals of Operations Research, no. 1 (2017): 119-139

Cited by43EIBibtex

View All

Base Info Papers Patents Projects

Marcus RittBinding

Papers74 papers

Marcus Ritt