A Branch-and-Price Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand. - Jonatas B. C. Chagas; André G. Santos 001 (ISDA, 2016)

Simulated annealing metaheuristic for the Double Vehicle Routing Problem with Multiple Stacks. - Jonatas B. C. Chagas; Ulisses Eduardo Ferreira da Silveira; Marcelo Pinheiro Leite Benedito; André G. Santos 001 (ITSC, 2016)

A Mixed-Integer Linear Programming Model and a Simulated Annealing Algorithm for the Long-Term Preventive Maintenance Scheduling Problem. - Roberto D. Aquino; Jonatas B. C. Chagas; Marcone J. F. Souza (ISDA, 2017)

An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand. - Jonatas B. C. Chagas; André G. Santos 001 (ISDA, 2017)

A Memetic Algorithm for the Network Construction Problem with Due Dates. - Jonatas B. C. Chagas; André G. Santos 001; Marcone J. F. Souza (ISDA, 2017)

The Thief Orienteering Problem: Formulation and Heuristic Approaches. - André G. Santos 001; Jonatas B. C. Chagas (CEC, 2018)

A Variable Neighborhood Search Algorithm for the Long-term Preventive Maintenance Scheduling Problem. - Roberto D. Aquino; Jonatas B. C. Chagas; Marcone J. F. Souza (ICEIS (1), 2018)

A Late Acceptance Hill-Climbing Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand. - André L. S. Souza; Jonatas B. C. Chagas; Puca Huachi Vaz Penna; Marcone J. F. Souza (ISDA (1), 2018)

A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem. - André Luyde S. Souza; Jonatas B. C. Chagas; Puca Huachi Vaz Penna; Marcone J. F. Souza (ICVNS, 2019)

A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks. - Jonatas B. C. Chagas; Ulisses Eduardo Ferreira da Silveira; André G. Santos 001; Marcone J. F. Souza (Int. Trans. Oper. Res., 2020)

Ants can orienteer a thief in their robbery. - Jonatas B. C. Chagas; Markus Wagner 007 (Oper. Res. Lett., 2020)

A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. - Jonatas B. C. Chagas; Julian Blank; Markus Wagner 007; Marcone J. F. Souza; Kalyanmoy Deb (J. Heuristics, 2021)

A weighted-sum method for solving the bi-objective traveling thief problem. - Jonatas B. C. Chagas; Markus Wagner 007 (Comput. Oper. Res., 2022)

The double traveling salesman problem with partial last-in-first-out loading constraints. - Jonatas B. C. Chagas; Túlio A. M. Toffolo; Marcone J. F. Souza; Manuel Iori (Int. Trans. Oper. Res., 2022)

Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach. - Jonatas B. C. Chagas; Markus Wagner 007 (Optim. Lett., 2022)