Elisangela Martins de Sá

15 papers C 1Journal 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A GVNS algorithm applied to the uncapacitated single allocation hub maximal covering problem with fixed costs. Oper. Res. Fernando Félix Oliveira e Silva, Elisangela Martins de Sá, Sérgio Ricardo de Souza
2026	J	`jnl`	A Tabu Search algorithm for the single source capacitated partial set covering location problem. J. Heuristics Fábio Pires Mourão, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza
2025	J	`jnl`	A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs. J. Heuristics Elisama de Araújo Silva Oliveira, Elizabeth F. Wanner, Elisangela Martins de Sá, Sérgio Ricardo de Souza
2024	J	`jnl`	A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems. J. Heuristics Guilherme Barbosa de Almeida, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza
2024	J	`jnl`	Formulations and heuristic for the long-term preventive maintenance order scheduling problem. Comput. Oper. Res. João Luiz Marques de Andrade, Marcone Jamilson Freitas Souza, Elisangela Martins de Sá, Gustavo Campos Menezes, Sérgio Ricardo de Souza
2023	J	`jnl`	A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale. Comput. Oper. Res. Nayane Carvalho Freitas, Elisangela Martins de Sá, Sérgio Ricardo de Souza
2023	J	`jnl`	ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation. Comput. Oper. Res. Fabricio Alves Oliveira, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza
2022	J	`jnl`	Benders decomposition applied to profit maximizing hub location problem with incomplete hub network. Comput. Oper. Res. Fabricio Alves Oliveira, Elisangela Martins de Sá, Sérgio Ricardo de Souza
2021	J	`jnl`	A mixed-integer linear programming model to solve the Multidimensional Multi-Way Number Partitioning Problem. Comput. Oper. Res. Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá
2019	C	`conf`	Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning Problem. LAGOS Alexandre Frias Faria, Sérgio Ricardo de Souza, Elisangela Martins de Sá, Carlos Alexandre Silva
2018	J	`jnl`	Benders decomposition applied to a robust multiple allocation incomplete hub location problem. Comput. Oper. Res. Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo
2018	J	`jnl`	Efficient Benders decomposition algorithms for the robust multiple allocation incomplete hub location problem with service time requirements. Expert Syst. Appl. Elisangela Martins de Sá, Reinaldo Morabito, Ricardo Saraiva de Camargo
2015	J	`jnl`	Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur. J. Oper. Res. Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau
2015	J	`jnl`	The Hub Line Location Problem. Transp. Sci. Elisangela Martins de Sá, Iván A. Contreras, Jean-François Cordeau, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.
2013	J	`jnl`	An improved Benders decomposition algorithm for the tree of hubs location problem. Eur. J. Oper. Res. Elisangela Martins de Sá, Ricardo Saraiva de Camargo, Gilberto de Miranda Jr.