Glaydston Mattos Ribeiro
Orcid: 0000-0001-8452-057X
According to our database1,
Glaydston Mattos Ribeiro
authored at least 38 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
J. Simulation, March, 2024
2023
Metaheuristics with variable diversity control and neighborhood search for the Heterogeneous Site-Dependent Multi-depot Multi-trip Periodic Vehicle Routing Problem.
Comput. Oper. Res., May, 2023
2022
A Hybrid BRKGA Approach for the Multiproduct Two Stage Capacitated Facility Location Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022
2021
Designing screen layout in multimedia applications through integer programming and metaheuristic.
RAIRO Oper. Res., 2021
Hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem.
Int. Trans. Oper. Res., 2021
Expert Syst. Appl., 2021
Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions.
Eur. J. Oper. Res., 2021
Proceedings of the IEEE Congress on Evolutionary Computation, 2021
2020
A framework for evaluating the dynamic impacts of the Brazilian Urban Mobility Policy for transportation socioeconomic systems: A case study in Rio de Janeiro.
J. Simulation, 2020
A progressive hybrid set covering based algorithm for the traffic counting location problem.
Expert Syst. Appl., 2020
Network sensor location problem with monitored lanes: Branch-and-cut and clustering search solution techniques.
Comput. Ind. Eng., 2020
2019
RAIRO Oper. Res., 2019
Proceedings of the 8th Brazilian Conference on Intelligent Systems, 2019
2016
Exact formulations for the minimum interference problem in <i>k</i>-connected <i>ad hoc</i> wireless networks.
Int. Trans. Oper. Res., 2016
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem.
Comput. Oper. Res., 2016
A mathematical model and a Clustering Search metaheuristic for planning the helicopter transportation of employees to the production platforms of oil and gas.
Comput. Ind. Eng., 2016
Comput. Ind. Eng., 2016
2014
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon.
J. Heuristics, 2014
A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem.
Eur. J. Oper. Res., 2014
A simple and effective genetic algorithm for the two-stage capacitated facility location problem.
Comput. Ind. Eng., 2014
2013
Expert Syst. Appl., 2013
2012
Eur. J. Oper. Res., 2012
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
2011
A lagrangean decomposition for the maximum independent set problem applied to map labeling.
Oper. Res., 2011
A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields.
Comput. Ind. Eng., 2011
2010
J. Comb. Optim., 2010
Int. J. Nat. Comput. Res., 2010
A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem.
Comput. Oper. Res., 2010
2009
A decomposition approach for the probabilistic maximal covering location-allocation problem.
Comput. Oper. Res., 2009
2008
J. Oper. Res. Soc., 2008
Column generation approach for the point-feature cartographic label placement problem.
J. Comb. Optim., 2008
A greedy randomized adaptive search procedure for the point-feature cartographic label placement.
Comput. Geosci., 2008
Lagrangean relaxation with clusters for point-feature cartographic label placement problems.
Comput. Oper. Res., 2008
2007
Lagrangean relaxation with clusters for some optimization problems modeled by conflict graphs.
PhD thesis, 2007
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem.
Comput. Oper. Res., 2007
2006