default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcus Ritt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Marcus Ritt, Daniel Alejandro Rossit
:
Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations. Comput. Oper. Res. 170: 106742 (2024)- [j28]Rafael Vales Bettker, Pedro Minini, André G. Pereira, Marcus Ritt:
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning. J. Artif. Intell. Res. 80: 243-271 (2024) - [c41]Gustavo Delazeri, Marcus Ritt:
Iterated Beam Search for Wildland Fire Suppression. EvoApplications@EvoStar 2024: 273-286 - 2023
- [j27]Jordi Pereira, Marcus Ritt:
Exact and heuristic methods for a workload allocation problem with chain precedence constraints. Eur. J. Oper. Res. 309(1): 387-398 (2023) - 2022
- [j26]Artur Brum, Rubén Ruiz, Marcus Ritt:
Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization. Comput. Ind. Eng. 163: 107843 (2022) - [j25]Marcelo de Souza, Marcus Ritt, Manuel López-Ibáñez:
Capping methods for the automatic configuration of optimization algorithms. Comput. Oper. Res. 139: 105615 (2022) - [j24]Alex Gliesch, Marcus Ritt:
A new heuristic for finding verifiable k-vertex-critical subgraphs. J. Heuristics 28(1): 61-91 (2022) - [c40]Marcelo de Souza, Marcus Ritt, Manuel López-Ibáñez:
Efficient configuration of optimization algorithms. GECCO Companion 2022: 17-18 - [c39]Marcelo de Souza, Marcus Ritt:
Improved regression models for algorithm configuration. GECCO 2022: 222-231 - [c38]Gustavo Delazeri, Marcus Ritt, Marcelo de Souza:
Comparing Surrogate Models for Tuning Optimization Algorithms. LION 2022: 347-360 - [i5]Rafael Vales Bettker, Pedro Minini, André G. Pereira, Marcus Ritt:
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning. CoRR abs/2211.13316 (2022) - 2021
- [j23]Alex Gliesch, Marcus Ritt:
A hybrid heuristic for the maximum dispersion problem. Eur. J. Oper. Res. 288(3): 721-735 (2021) - [j22]Janaina Schwarzrock, Charles Cardoso De Oliveira, Marcus Ritt, Arthur Francisco Lorenzon, Antonio Carlos Schneider Beck:
A Runtime and Non-Intrusive Approach to Optimize EDP by Tuning Threads and CPU Frequency for OpenMP Applications. IEEE Trans. Parallel Distributed Syst. 32(7): 1713-1724 (2021) - [c37]Gustavo Delazeri, Marcus Ritt:
Fast Heuristics for Traveling Salesman Problems with Multiple Flying Sidekicks. CEC 2021: 1365-1371 - [c36]João Pedro Gonçalves Moreira, Marcus Ritt:
Evolving Allocation Rules for Beam Search Heuristics in Assembly Line Balancing. EuroGP 2021: 214-228 - [c35]Marcus Ritt, Alexander J. Benavides:
The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan. GECCO 2021: 270-277 - 2020
- [j21]Marcus Ritt, Jordi Pereira:
Heuristic and exact algorithms for minimum-weight non-spanning arborescences. Eur. J. Oper. Res. 287(1): 61-75 (2020) - [c34]Wesley L. Kaizer, André Grahl Pereira, Marcus Ritt:
Sequencing Operator Counts with State-Space Search. ICAPS 2020: 166-174 - [c33]Alex Gliesch, Marcus Ritt, Arthur H. S. Cruz, Mayron César O. Moreira:
A heuristic algorithm for districting problems with similarity constraints. CEC 2020: 1-8 - [c32]Alex Gliesch, Marcus Ritt, Arthur H. S. Cruz, Mayron César O. Moreira:
A hybrid heuristic for districting problems with routing criteria. CEC 2020: 1-9
2010 – 2019
- 2019
- [c31]João Pedro Gonçalves Moreira, Marcus Ritt:
Evolving task priority rules for heterogeneous assembly line balancing. CEC 2019: 1423-1430 - [c30]Alex Gliesch, Marcus Ritt:
A generic approach to districting with diameter or center-based objectives. GECCO 2019: 249-257 - 2018
- [j20]Tadeu K. Zubaran, Marcus Ritt:
An effective heuristic algorithm for the partial shop scheduling problem. Comput. Oper. Res. 93: 51-65 (2018) - [j19]Jordi Pereira, Marcus Ritt, Óscar C. Vásquez:
A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Comput. Oper. Res. 99: 249-261 (2018) - [j18]Alexander J. Benavides, Marcus Ritt:
Fast heuristics for minimizing the makespan in non-permutation flow shops. Comput. Oper. Res. 100: 230-243 (2018) - [j17]Leonardo Borba, Marcus Ritt, Cristóbal Miralles:
Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem. Eur. J. Oper. Res. 270(1): 146-156 (2018) - [j16]Marcus Ritt, Alysson M. Costa:
Improved integer programming models for simple assembly line balancing and related problems. Int. Trans. Oper. Res. 25(4): 1345-1359 (2018) - [c29]Artur Brum, Marcus Ritt:
Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops. CEC 2018: 1-8 - [c28]Marcelo de Souza, Marcus Ritt:
An Automatically Designed Recombination Heuristic for the Test-Assignment Problem. CEC 2018: 1-8 - [c27]Marcelo de Souza, Marcus Ritt:
Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming. EvoCOP 2018: 67-84 - [c26]Artur Brum, Marcus Ritt:
Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time. EvoCOP 2018: 85-100 - [c25]Alex Gliesch, Marcus Ritt, Mayron César O. Moreira:
A Multistart Alternating Tabu Search for Commercial Districting. EvoCOP 2018: 158-173 - [c24]Augusto B. Corrêa, André Grahl Pereira, Marcus Ritt:
Analyzing Tie-Breaking Strategies for the A* Algorithm. IJCAI 2018: 4715-4721 - 2017
- [j15]Fernando Stefanello, Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt:
On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res. 249(1-2): 119-139 (2017) - [j14]Paulo Vitor Silvestrin, Marcus Ritt:
An iterated tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. 81: 192-202 (2017) - [c23]Alex Gliesch, Marcus Ritt, Mayron César O. Moreira:
A genetic algorithm for fair land allocation. GECCO 2017: 793-800 - 2016
- [j13]Gabriel M. Portal, Marcus Ritt, Leonardo Borba, Luciana S. Buriol:
Simulated annealing for the machine reassignment problem. Ann. Oper. Res. 242(1): 93-114 (2016) - [j12]Alexander J. Benavides, Marcus Ritt:
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. Comput. Oper. Res. 66: 160-169 (2016) - [j11]André Grahl Pereira, Marcus Ritt, Luciana S. Buriol:
Pull and PushPull are PSPACE-complete. Theor. Comput. Sci. 628: 50-61 (2016) - [c22]Alex Gliesch, Marcus Ritt:
Solving Atomix with Pattern Databases. BRACIS 2016: 61-66 - [c21]Augusto B. Corrêa, André Grahl Pereira, Marcus Ritt:
Improved Airport Ground Traffic Control with Domain-Dependent Heuristics. BRACIS 2016: 73-78 - [c20]Marcus Ritt:
A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem. CASE 2016: 872-877 - [c19]André Grahl Pereira, Robert Holte, Jonathan Schaeffer, Luciana S. Buriol, Marcus Ritt:
Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban. IJCAI 2016: 662-668 - [c18]Marcelo de Souza, Marcus Ritt, Ana L. C. Bazzan:
A bi-objective method of traffic assignment for electric vehicles. ITSC 2016: 2319-2324 - 2015
- [j10]André Grahl Pereira, Marcus Ritt, Luciana S. Buriol:
Optimal Sokoban solving using pattern databases with specific domain knowledge. Artif. Intell. 227: 52-70 (2015) - [j9]Leonardo Steinfeld, Marcus Ritt, Fernando Silveira, Luigi Carro:
Optimum design of a banked memory with power management for wireless sensor networks. Wirel. Networks 21(1): 81-94 (2015) - [c17]Alexander Javier Benavides, Marcus Ritt:
Iterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops. ICAPS 2015: 34-41 - [c16]Renato R. Leme, André Grahl Pereira, Marcus Ritt, Luciana S. Buriol:
Solving Sokoban Optimally with Domain-Dependent Move Pruning. BRACIS 2015: 264-269 - [c15]Germano C. Carniel, Alexander J. Benavides, Marcus Ritt, Cristóbal Miralles:
Including workers with disabilities in flow shop scheduling. CASE 2015: 985-991 - 2014
- [j8]Leonardo Borba, 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 (2014) - [j7]Alexander J. Benavides, Marcus Ritt, Cristóbal Miralles:
Flow shop scheduling with heterogeneous workers. Eur. J. Oper. Res. 237(2): 713-720 (2014) - [c14]Jody Maick Matos, Marcus Ritt, Renato P. Ribas, André Inácio Reis:
Deriving Reduced Transistor Count Circuits from AIGs. SBCCI 2014: 40:1-40:7 - 2013
- [j6]Alexander J. Benavides, Marcus Ritt, Luciana S. Buriol, Paulo Morelato França:
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks. Comput. Oper. Res. 40(1): 24-32 (2013) - [c13]Leonardo Steinfeld, Fernando Silveira, Marcus Ritt, Luigi Carro:
A New Memory Banking System for Energy-Efficient Wireless Sensor Networks. DCOSS 2013: 215-222 - [c12]Leonardo Steinfeld, Marcus Ritt, Fernando Silveira, Luigi Carro:
Low-Power Processors Require Effective Memory Partitioning. IESS 2013: 73-81 - [c11]Thomas Schweizer, Wolfgang Rosenstiel, Luigi Vaz Ferreira, Marcus Ritt:
Timing error handling on CGRAs. ReConFig 2013: 1-6 - [c10]André Grahl Pereira, Marcus Ritt, Luciana Salete Buriol:
Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases. SOCS 2013: 141-148 - [i4]Leonardo Borba, Marcus Ritt:
Exact and Heuristic Methods for the Assembly Line Worker Assignment and Balancing Problem. CoRR abs/1308.0299 (2013) - 2012
- [j5]Mayron César O. Moreira, Marcus Ritt, Alysson M. Costa, Antonio Augusto Chaves:
Simple heuristics for the assembly line worker assignment and balancing problem. J. Heuristics 18(3): 505-524 (2012) - [c9]Victor Billy da Silva, Marcus Ritt, Joao Batista da Paz Carvalho, Marcos Jose Brusso, Juliano Tonezer da Silva, Alexandre Lazaretti Zanatta:
A real-valued genetic algorithm for gemstone cutting. CLEI 2012: 1-8 - 2011
- [j4]Roger Reis, Marcus Ritt, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int. Trans. Oper. Res. 18(3): 401-423 (2011) - [c8]Luciana S. Buriol, Marcus Ritt, Félix Carvalho Rodrigues, Guido Schäfer:
On the Smoothed Price of Anarchy of the Traffic Assignment Problem. ATMOS 2011: 122-133 - [c7]Ana L. C. Bazzan, Maicon de Brito do Amarante, Guilherme G. Azzi, Alexander J. Benavides, Luciana S. Buriol, Leonardo F. S. Moura, Marcus Ritt, Tiago Sommer:
Extending Traffic Simulation Based On Cellular Automata: From ParticlesTo Autonomous Agents. ECMS 2011: 91-97 - [i3]Marcus Ritt, Alysson M. Costa:
A comparison of formulations for the simple assembly line balancing problem. CoRR abs/1111.0934 (2011) - 2010
- [j3]Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt:
A biased random-key genetic algorithm for road congestion minimization. Optim. Lett. 4(4): 619-633 (2010) - [c6]Marcus Ritt, Carlos Arthur Lang Lisbôa, Luigi Carro, Cristiano Lazzari:
A Cost-Effective Technique for Mapping BLUTs to QLUTs in FPGAs. FPL 2010: 332-335 - [i2]Mayron César O. Moreira, Alysson M. Costa, Marcus Ritt, Antonio Augusto Chaves:
Simple heuristics for the assembly line worker assignment and balancing problem. CoRR abs/1003.3676 (2010) - [i1]Marcus Ritt:
Motion planning with pull moves. CoRR abs/1008.2952 (2010)
2000 – 2009
- 2009
- [j2]Marcus Ritt, Alysson M. Costa, Sérgio L. S. Mergen, Viviane Moreira Orengo:
An integer linear programming approach for approximate string comparison. Eur. J. Oper. Res. 198(3): 706-714 (2009) - [j1]Edson Prestes e Silva Jr., Marcus Ritt, Gustavo Führ:
An improved particle filter for sparse environments. J. Braz. Comput. Soc. 15(3): 55-64 (2009) - 2008
- [c5]Edson Prestes e Silva Jr., Marcus Ritt, Gustavo Führ:
Improving Monte Carlo Localization in sparse environments using structural environment information. IROS 2008: 3465-3470 - [c4]Patrick Heckeler, Marcus Ritt, Jörg Behrend, Wolfgang Rosenstiel:
Object-Oriented Message-Passing in Heterogeneous Environments. PVM/MPI 2008: 151-158 - 2003
- [b1]Marcus Ritt:
Eine objektorientierte Kommunikationsbibliothek zur parallelen Programmierung - TPO++. Eberhard Karls University of Tübingen, 2003, ISBN 3-89873-884-1, pp. 1-167 - 2000
- [c3]Tobias Grundmann, Marcus Ritt, Wolfgang Rosenstiel:
Object-Oriented Message-Passing with TPO++ (Research Note). Euro-Par 2000: 1081-1084 - [c2]Tobias Grundmann, Marcus Ritt, Wolfgang Rosenstiel:
TPO++: An Object-Oriented Message-Passing Library in C++. ICPP 2000: 43-50
1990 – 1999
- 1998
- [c1]Björn Steckelbach, Till Bubeck, Ulrich Fößmeier, Michael Kaufmann, Marcus Ritt, Wolfgang Rosenstiel:
Visualization of Parallel Execution Graphs. GD 1998: 403-412
Coauthor Index
aka: Luciana Salete Buriol
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
