Armando Honorio Pereira

Orcid: 0000-0003-2837-0284

According to our database1, Armando Honorio Pereira authored at least 6 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The widest <i>k</i>-set of disjoint paths problem.
RAIRO Oper. Res., January, 2023

2022
Branch-and-cut algorithms for the -arborescence star problem.
Int. Trans. Oper. Res., 2022

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
Eur. J. Oper. Res., 2022

2021
The Two-Dimensional Guillotine Cutting Stock Problem with Stack Constraints.
Proceedings of the XLVII Latin American Computing Conference, 2021

2018
Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks.
Comput. Oper. Res., 2018

2017
A framework to collect and extract publication lists of a given researcher from the web.
Int. J. Web Eng. Technol., 2017


  Loading...