Luiz Antonio Nogueira Lorena

Author Info

Name	Affiliation	Papers
LUIZ ANTONIO NOGUEIRA LORENA	Lab. Associado de Computação e Matemática Aplicada, Instituto Nacional de Pesquisas Espaciais – INPE, S. José dos Campos, SP Brasil	59
Collaborators	Citations	PageRank
63	498	36.72
Referers	Referees	References
774	782	651

Search Limit

100782

Publications (59 rows)

Collaborators (63 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A mathematical model for the coverage location problem with overlap control	0	0.34	2020
Improving the Clustering Search heuristic: An application to cartographic labeling.	0	0.34	2019
A hybrid heuristic for the overlapping cluster editing problem	2	0.38	2019
Improving The Performance Of An Integer Linear Programming Community Detection Algorithm Through Clique Filtering	0	0.34	2019
A biased random-key genetic algorithm for the two-stage capacitated facility location problem.	1	0.35	2019
Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem.	2	0.42	2018
Preprocessing Technique For Cluster Editing Via Integer Linear Programming	0	0.34	2018
A comparison of two hybrid methods for constrained clustering problems.	1	0.34	2017
An Adaptive Large Neighborhood Search for the Discrete and Continuous Berth Allocation Problem	12	0.58	2016
Berth allocation in an ore terminal with demurrage, despatch and maintenance.	5	0.43	2016
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem	10	0.60	2016
A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem	9	0.52	2015
An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times	11	0.49	2014
Hybrid heuristics based on column generation with path-relinking for clustering problems.	4	0.38	2014
A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem.	12	0.53	2014
Dispersion for the point-feature cartographic label placement problem	5	0.42	2013
Clustering Search for the Berth Allocation Problem	20	0.86	2012
A new evolutionary clustering search for a no-wait flow shop problem with set-up times	18	0.64	2012
Clustering search heuristic for solving a continuous berth allocation problem	6	0.47	2012
New models for the Mirrored Traveling Tournament Problem	4	0.40	2012
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem	3	0.43	2012
A column generation approach for the unconstrained binary quadratic programming problem.	3	0.39	2012
A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields	6	0.55	2011
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem	10	0.53	2011
Lagrangean Decompositions For The Unconstrained Binary Quadratic Programming Problem	4	0.42	2011
A Memetic Algorithm for a Continuous case of the Berth Allocation Problem.	3	0.41	2011
A lagrangean decomposition for the maximum independent set problem applied to map labeling.	0	0.34	2011
Strong formulation for the spot 5 daily photograph scheduling problem	5	0.44	2010
Advances in Clustering Search	3	0.45	2010
A Decomposition Heuristic for the Maximal Covering Location Problem	4	0.48	2010
Clustering search algorithm for the capacitated centered clustering problem	22	0.96	2010
Customers' satisfaction in a dial-a-ride problem	8	0.69	2009
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem	19	1.06	2009
A decomposition approach for the probabilistic maximal covering location-allocation problem	9	0.57	2009
A greedy randomized adaptive search procedure for the point-feature cartographic label placement	16	0.70	2008
Hybrid metaheuristic for the prize collecting travelling salesman problem	5	0.68	2008
Lagrangean relaxation with clusters for point-feature cartographic label placement problems	10	0.66	2008
A Constructive Genetic Algorithm for permutation flowshop scheduling	20	0.84	2008
Column generation approach for the point-feature cartographic label placement problem	6	0.50	2008
Clustering search approach for the traveling tournament problem	6	0.50	2007
Evolutionary clustering search for flowtime minimization in permutation flow shop	11	0.85	2007
Hybrid heuristics for the probabilistic maximal covering location-allocation problem	4	0.44	2007
A column generation approach for the maximal covering location problem	9	0.60	2007
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling	7	0.57	2007
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem	9	0.65	2007
Pattern Sequencing Problems by Clustering Search	6	0.51	2006
Mirrored traveling tournament problem: an evolutionary approach	3	0.47	2006
Heuristics for cartographic label placement problems	8	0.57	2006
Population Training Heuristics	4	0.55	2005
Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem	6	0.73	2005

1
2
50 / page