Marcus Ritt

Proceedings of the Applications of Evolutionary Computation - 27th European Conference, 2024

2023

Exact and heuristic methods for a workload allocation problem with chain precedence constraints.

[BibT_eX]

[DOI]

Jordi Pereira

Eur. J. Oper. Res., August, 2023

2022

A new heuristic for finding verifiable k-vertex-critical subgraphs.

[BibT_eX]

[DOI]

J. Heuristics, 2022

Capping methods for the automatic configuration of optimization algorithms.

[BibT_eX]

[DOI]

Manuel López-Ibáñez

Comput. Oper. Res., 2022

Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization.

[BibT_eX]

[DOI]

Artur Brum

Rubén Ruiz

Comput. Ind. Eng., 2022

Comparing Surrogate Models for Tuning Optimization Algorithms.

[BibT_eX]

[DOI]

Gustavo Delazeri

Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

Improved regression models for algorithm configuration.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

Efficient configuration of optimization algorithms.

[BibT_eX]

[DOI]

Charles Cardoso De Oliveira

Manuel López-Ibáñez

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021

A Runtime and Non-Intrusive Approach to Optimize EDP by Tuning Threads and CPU Frequency for OpenMP Applications.

[BibT_eX]

[DOI]

Janaina Schwarzrock

Arthur Francisco Lorenzon

Antonio Carlos Schneider Beck

IEEE Trans. Parallel Distributed Syst., 2021

A hybrid heuristic for the maximum dispersion problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

The tiebreaking space of constructive heuristics for the permutation flowshop minimizing makespan.

[BibT_eX]

[DOI]

João Pedro Gonçalves Moreira

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Evolving Allocation Rules for Beam Search Heuristics in Assembly Line Balancing.

[BibT_eX]

[DOI]

Proceedings of the Genetic Programming - 24th European Conference, 2021

Fast Heuristics for Traveling Salesman Problems with Multiple Flying Sidekicks.

[BibT_eX]

[DOI]

Gustavo Delazeri

Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020

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

[BibT_eX]

[DOI]

Jordi Pereira

Eur. J. Oper. Res., 2020

A hybrid heuristic for districting problems with routing criteria.

[BibT_eX]

[DOI]

Arthur H. S. Cruz

Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A heuristic algorithm for districting problems with similarity constraints.

[BibT_eX]

[DOI]

Arthur H. S. Cruz

Proceedings of the IEEE Congress on Evolutionary Computation, 2020

Sequencing Operator Counts with State-Space Search.

[BibT_eX]

[DOI]

Wesley L. Kaizer

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2019

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

[BibT_eX]

[DOI]

João Pedro Gonçalves Moreira

Proceedings of the Genetic and Evolutionary Computation Conference, 2019

Evolving task priority rules for heterogeneous assembly line balancing.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2019

2018

Improved integer programming models for simple assembly line balancing and related problems.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2018

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

[BibT_eX]

[DOI]

Leonardo Borba

Cristóbal Miralles

Eur. J. Oper. Res., 2018

An effective heuristic algorithm for the partial shop scheduling problem.

[BibT_eX]

[DOI]

Tadeu K. Zubaran

Comput. Oper. Res., 2018

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

[BibT_eX]

[DOI]

Jordi Pereira

Óscar C. Vásquez

Comput. Oper. Res., 2018

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

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

Analyzing Tie-Breaking Strategies for the A* Algorithm.

[BibT_eX]

[DOI]

Augusto B. Corrêa

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

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

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2018

A Multistart Alternating Tabu Search for Commercial Districting.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2018

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

[BibT_eX]

[DOI]

Artur Brum

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2018

An Automatically Designed Recombination Heuristic for the Test-Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

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

[BibT_eX]

[DOI]

Artur Brum

Proceedings of the 2018 IEEE Congress on Evolutionary Computation, 2018

2017

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

[BibT_eX]

[DOI]

Paulo Vitor Silvestrin

Comput. Oper. Res., 2017

On the minimization of traffic congestion in road networks with tolls.

[BibT_eX]

[DOI]

Mauricio G. C. Resende

Ann. Oper. Res., 2017

A genetic algorithm for fair land allocation.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

Pull and PushPull are PSPACE-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2016

Simulated annealing for the machine reassignment problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

A bi-objective method of traffic assignment for electric vehicles.

[BibT_eX]

[DOI]

Ana L. C. Bazzan

Proceedings of the 19th IEEE International Conference on Intelligent Transportation Systems, 2016

Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Automation Science and Engineering, 2016

Solving Atomix with Pattern Databases.

[BibT_eX]

[DOI]

Proceedings of the 5th Brazilian Conference on Intelligent Systems, 2016

Improved Airport Ground Traffic Control with Domain-Dependent Heuristics.

[BibT_eX]

[DOI]

Augusto B. Corrêa

Proceedings of the 5th Brazilian Conference on Intelligent Systems, 2016

2015

Optimum design of a banked memory with power management for wireless sensor networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2015

Optimal Sokoban solving using pattern databases with specific domain knowledge.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Including workers with disabilities in flow shop scheduling.

[BibT_eX]

[DOI]

Germano C. Carniel

Alexander Javier Benavides

Cristóbal Miralles

Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

Solving Sokoban Optimally with Domain-Dependent Move Pruning.

[BibT_eX]

[DOI]

Proceedings of the 2015 Brazilian Conference on Intelligent Systems, 2015

Iterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

2014

Flow shop scheduling with heterogeneous workers.

[BibT_eX]

[DOI]

Cristóbal Miralles

Eur. J. Oper. Res., 2014

A heuristic and a branch-and-bound algorithm for the Assembly Line Worker Assignment and Balancing Problem.

[BibT_eX]

[DOI]

Leonardo Borba

Comput. Oper. Res., 2014

Deriving Reduced Transistor Count Circuits from AIGs.

[BibT_eX]

[DOI]

Proceedings of the 27th Symposium on Integrated Circuits and Systems Design, 2014

2013

Exact and Heuristic Methods for the Assembly Line Worker Assignment and Balancing Problem.

[BibT_eX]

[DOI]

Leonardo Borba

CoRR, 2013

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks.

[BibT_eX]

[DOI]

Paulo Morelato França

Comput. Oper. Res., 2013

Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases.

[BibT_eX]

[DOI]

Luciana Salete Buriol

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Timing error handling on CGRAs.

[BibT_eX]

[DOI]

Proceedings of the 2012 International Conference on Reconfigurable Computing and FPGAs, 2013

Low-Power Processors Require Effective Memory Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Embedded Systems: Design, Analysis and Verification, 2013

A New Memory Banking System for Energy-Efficient Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2013

2012

Simple heuristics for the assembly line worker assignment and balancing problem.

[BibT_eX]

[DOI]

Antonio Augusto Chaves

J. Heuristics, 2012

A real-valued genetic algorithm for gemstone cutting.

[BibT_eX]

[DOI]

Victor Billy da Silva

Joao Batista da Paz Carvalho

Marcos Jose Brusso

Juliano Tonezer da Silva

Alexandre Lazaretti Zanatta

Proceedings of the 2012 XXXVIII Conferencia Latinoamericana En Informatica (CLEI), 2012

2011

A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion.

[BibT_eX]

[DOI]

Roger Reis

Mauricio G. C. Resende

Int. Trans. Oper. Res., 2011

A comparison of formulations for the simple assembly line balancing problem

[BibT_eX]

[DOI]

Maicon de Brito do Amarante

CoRR, 2011

Extending Traffic Simulation Based On Cellular Automata: From ParticlesTo Autonomous Agents.

[BibT_eX]

[DOI]

Ana L. C. Bazzan

Guilherme G. Azzi

Proceedings of the 25th European Conference on Modelling and Simulation, 2011

On the Smoothed Price of Anarchy of the Traffic Assignment Problem.

[BibT_eX]

[DOI]

Félix Carvalho Rodrigues

Guido Schäfer

Proceedings of the ATMOS 2011, 2011

2010

A biased random-key genetic algorithm for road congestion minimization.

[BibT_eX]

[DOI]

Mauricio G. C. Resende

Optim. Lett., 2010

Motion planning with pull moves

[BibT_eX]

[DOI]

CoRR, 2010

A Cost-Effective Technique for Mapping BLUTs to QLUTs in FPGAs.

[BibT_eX]

[DOI]

Carlos Arthur Lang Lisbôa

Luigi Carro

Cristiano Lazzari

Proceedings of the International Conference on Field Programmable Logic and Applications, 2010

2009

An improved particle filter for sparse environments.

[BibT_eX]

[DOI]

Edson Prestes e Silva Jr.

Gustavo Führ

J. Braz. Comput. Soc., 2009

An integer linear programming approach for approximate string comparison.

[BibT_eX]

[DOI]

Edson Prestes e Silva Jr.

Sérgio L. S. Mergen

Viviane Moreira Orengo

Eur. J. Oper. Res., 2009

2008

Object-Oriented Message-Passing in Heterogeneous Environments.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2008

Improving Monte Carlo Localization in sparse environments using structural environment information.

[BibT_eX]

[DOI]

Gustavo Führ

Proceedings of the 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008

2003

Eine objektorientierte Kommunikationsbibliothek zur parallelen Programmierung - TPO++.

[BibT_eX]

[DOI]

PhD thesis, 2003

2000

TPO++: An Object-Oriented Message-Passing Library in C++.

[BibT_eX]

[DOI]

Tobias Grundmann

Wolfgang Rosenstiel

Proceedings of the 2000 International Conference on Parallel Processing, 2000

Object-Oriented Message-Passing with TPO++ (Research Note).

[BibT_eX]

[DOI]

Tobias Grundmann