Elisangela Martins de Sá

Orcid: 0000-0002-7801-0087

According to our database1, Elisangela Martins de Sá authored at least 12 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems.
J. Heuristics, August, 2024

Formulations and heuristic for the long-term preventive maintenance order scheduling problem.
Comput. Oper. Res., 2024

2023
A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale.
Comput. Oper. Res., November, 2023

ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation.
Comput. Oper. Res., September, 2023

2022
Benders decomposition applied to profit maximizing hub location problem with incomplete hub network.
Comput. Oper. Res., 2022

2021
A mixed-integer linear programming model to solve the Multidimensional Multi-Way Number Partitioning Problem.
Comput. Oper. Res., 2021

2019
Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements.
Expert Syst. Appl., 2018

Benders decomposition applied to a robust multiple allocation incomplete hub location problem.
Comput. Oper. Res., 2018

2015
The Hub Line Location Problem.
Transp. Sci., 2015

Exact and heuristic algorithms for the design of hub networks with multiple lines.
Eur. J. Oper. Res., 2015

2013
An improved Benders decomposition algorithm for the tree of hubs location problem.
Eur. J. Oper. Res., 2013


  Loading...