Luiz Antonio Nogueira Lorena

Orcid: 0000-0003-2043-1441

According to our database1, Luiz Antonio Nogueira Lorena authored at least 74 papers between 1999 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Solving the Point Feature Cartographic Label Placement problem using Jaccard index as a measure of labels intersection.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

An Adaptive Biased Random-key Genetic Algorithm for Rank Aggregation with Ties and Incomplete Rankings.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

2021
Hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem.
Int. Trans. Oper. Res., 2021

A Biased Random-key Genetic Algorithm with a Local Search Component for the Optimal Bucket Order Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2021

2020
A mathematical model for the coverage location problem with overlap control.
Comput. Ind. Eng., 2020

2019
A biased random-key genetic algorithm for the two-stage capacitated facility location problem.
Expert Syst. Appl., 2019

A hybrid heuristic for the overlapping cluster editing problem.
Appl. Soft Comput., 2019

Improving the Clustering Search heuristic: An application to cartographic labeling.
Appl. Soft Comput., 2019

Qualitative data clustering: a new Integer Linear Programming model.
Proceedings of the International Joint Conference on Neural Networks, 2019

Improving the Performance of an Integer Linear Programming Community Detection Algorithm Through Clique Filtering.
Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

2018
Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem.
Comput. Ind. Eng., 2018

Preprocessing Technique for Cluster Editing via Integer Linear Programming.
Proceedings of the Intelligent Computing Theories and Application, 2018

2017
A comparison of two hybrid methods for constrained clustering problems.
Appl. Soft Comput., 2017

2016
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem.
Comput. Oper. Res., 2016

Hybrid method with CS and BRKGA applied to the minimization of tool switches problem.
Comput. Oper. Res., 2016

Berth allocation in an ore terminal with demurrage, despatch and maintenance.
Comput. Ind. Eng., 2016

2015
Clustering Search and Variable Mesh Algorithms for continuous optimization.
Expert Syst. Appl., 2015

A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem.
Comput. Oper. Res., 2015

2014
Hybrid heuristics based on column generation with path-relinking for clustering problems.
Expert Syst. Appl., 2014

An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times.
Expert Syst. Appl., 2014

A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem.
Eur. J. Oper. Res., 2014

Clustering Search Applied to Rank Aggregation.
Proceedings of the 2014 Brazilian Conference on Intelligent Systems, 2014

2013
Dispersion for the point-feature cartographic label placement problem.
Expert Syst. Appl., 2013

2012
Clustering Search for the Berth Allocation Problem.
Expert Syst. Appl., 2012

A column generation approach for the unconstrained binary quadratic programming problem.
Eur. J. Oper. Res., 2012

A new evolutionary clustering search for a no-wait flow shop problem with set-up times.
Eng. Appl. Artif. Intell., 2012

Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem.
Comput. Oper. Res., 2012

New models for the Mirrored Traveling Tournament Problem.
Comput. Ind. Eng., 2012

Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011
A lagrangean decomposition for the maximum independent set problem applied to map labeling.
Oper. Res., 2011

Lagrangean decompositions for the unconstrained binary quadratic programming problem.
Int. Trans. Oper. Res., 2011

Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem.
Expert Syst. Appl., 2011

A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields.
Comput. Ind. Eng., 2011

Model and heuristic for berth allocation in tidal bulk ports with stock level constraints.
Comput. Ind. Eng., 2011

A Memetic Algorithm for a Continuous case of the Berth Allocation Problem.
Proceedings of the ECTA and FCTA 2011, 2011

2010
Strong formulation for the spot 5 daily photograph scheduling problem.
J. Comb. Optim., 2010

A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem.
Comput. Oper. Res., 2010

Clustering search algorithm for the capacitated centered clustering problem.
Comput. Oper. Res., 2010

A Decomposition Heuristic for the Maximal Covering Location Problem.
Adv. Oper. Res., 2010

Advances in Clustering Search.
Proceedings of the Soft Computing Models in Industrial and Environmental Applications, 2010

2009
Customers' satisfaction in a dial-a-ride problem.
IEEE Intell. Transp. Syst. Mag., 2009

A decomposition approach for the probabilistic maximal covering location-allocation problem.
Comput. Oper. Res., 2009

Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem.
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009

2008
Clustering Search Heuristic for the Capacitated <i>p</i> -Median Problem.
Proceedings of the Innovations in Hybrid Intelligent Systems, 2008

Optimizing the woodpulp stowage using Lagrangean relaxation with clusters.
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

A Constructive Genetic Algorithm for permutation flowshop scheduling.
Comput. Ind. Eng., 2008

A Hybrid Column Generation Approach for the Berth Allocation Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007
Hybrid heuristics for the probabilistic maximal covering location-allocation problem.
Oper. Res., 2007

A column generation approach for the maximal covering location problem.
Int. Trans. Oper. Res., 2007

A new hybrid heuristic for driver scheduling.
Int. J. Hybrid Intell. Syst., 2007

Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem.
Comput. Oper. Res., 2007

Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

Clustering Search Approach for the Traveling Tournament Problem.
Proceedings of the MICAI 2007: Advances in Artificial Intelligence, 2007

Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007

2006
Heuristics for cartographic label placement problems.
Comput. Geosci., 2006

Pattern Sequencing Problems by Clustering Search.
Proceedings of the Advances in Artificial Intelligence, 2006

Mirrored Traveling Tournament Problem: An Evolutionary Approach.
Proceedings of the Advances in Artificial Intelligence, 2006

2005
A branch-and-price approach to <i>p</i>-median location problems.
Comput. Oper. Res., 2005

Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem.
Proceedings of the 5th International Conference on Hybrid Intelligent Systems (HIS 2005), 2005

Fast Point-Feature Label Placement Algorithm for Real Time Screen Maps.
Proceedings of the VII Brazilian Symposium on Geoinformatics, 2005

Population Training Heuristics.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2005

2004
A column generation approach to capacitated p-median problems.
Comput. Oper. Res., 2004

Detecting Promising Areas by Evolutionary Clustering Search.
Proceedings of the Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29, 2004

2002
A constructive genetic algorithm for gate matrix layout problems.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

Tabu Search Heuristic for Point-Feature Cartographic Label Placement.
GeoInformatica, 2002

Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems.
Eur. J. Oper. Res., 2002

-Opt Population Training for Minimization of Open Stack Problem.
Proceedings of the Advances in Artificial Intelligence, 2002

2001
Constructive Genetic Algorithm for Clustering Problems.
Evol. Comput., 2001

A Constructive Evolutionary Approach to School Timetabling.
Proceedings of the Applications of Evolutionary Computing, 2001

1999
Lagrangean/surrogate relaxation for generalized assignment problems.
Eur. J. Oper. Res., 1999


  Loading...