default search action
Luiz Antonio Nogueira Lorena
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j50]Guilherme Oliveira Chagas
, Luiz Antonio Nogueira Lorena, Rafael Duarte Coelho dos Santos, Jacques Renaud, Leandro C. Coelho
A parallel variable neighborhood search for α-neighbor facility location problems. Comput. Oper. Res. 165: 106589 (2024) - [c25]Antônio Augusto Chaves, José Fernando Gonçalves
An adaptive biased random-key genetic algorithm for the tactical berth allocation problem. SAC 2024: 378-385 - 2022
- [c24]Luiz Henrique Nogueira Lorena
An Adaptive Biased Random-key Genetic Algorithm for Rank Aggregation with Ties and Incomplete Rankings. CEC 2022: 1-8 - [c23]Geraldo R. Mauri, Luiz Henrique Nogueira Lorena
Solving the Point Feature Cartographic Label Placement problem using Jaccard index as a measure of labels intersection. CEC 2022: 1-8 - 2021
- [j49]Geraldo Regis Mauri
Hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem. Int. Trans. Oper. Res. 28(6): 3069-3093 (2021) - [c22]Luiz Henrique Nogueira Lorena
A Biased Random-key Genetic Algorithm with a Local Search Component for the Optimal Bucket Order Problem. CEC 2021: 375-382 - 2020
- [j48]Eliseu Junio Araújo, Antônio Augusto Chaves, Luiz Antonio Nogueira Lorena
A mathematical model for the coverage location problem with overlap control. Comput. Ind. Eng. 146: 106548 (2020)
2010 – 2019
- 2019
- [j47]Eliseu Junio Araújo, Antônio Augusto Chaves, Luiz Antonio Nogueira Lorena
Improving the Clustering Search heuristic: An application to cartographic labeling. Appl. Soft Comput. 77: 261-273 (2019) - [j46]Guilherme Oliveira Chagas
A hybrid heuristic for the overlapping cluster editing problem. Appl. Soft Comput. 81 (2019) - [j45]Fabrício Lacerda Biajoli, Antônio Augusto Chaves
A biased random-key genetic algorithm for the two-stage capacitated facility location problem. Expert Syst. Appl. 115: 418-426 (2019) - [c21]Luiz Henrique Nogueira Lorena
Improving the Performance of an Integer Linear Programming Community Detection Algorithm Through Clique Filtering. ICCSA (1) 2019: 757-769 - [c20]Luiz Henrique Nogueira Lorena
Qualitative data clustering: a new Integer Linear Programming model. IJCNN 2019: 1-8 - 2018
- [j44]Antônio Augusto Chaves, José Fernando Gonçalves
Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem. Comput. Ind. Eng. 124: 331-346 (2018) - [c19]Luiz Henrique Nogueira Lorena
Preprocessing Technique for Cluster Editing via Integer Linear Programming. ICIC (1) 2018: 287-297 - 2017
- [j43]Rudinei Martins de Oliveira, Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
A comparison of two hybrid methods for constrained clustering problems. Appl. Soft Comput. 54: 256-266 (2017) - 2016
- [j42]Glaydston Mattos Ribeiro
Berth allocation in an ore terminal with demurrage, despatch and maintenance. Comput. Ind. Eng. 96: 8-15 (2016) - [j41]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Comput. Oper. Res. 67: 174-183 (2016) - [j40]Geraldo Regis Mauri
An adaptive large neighborhood search for the discrete and continuous Berth allocation problem. Comput. Oper. Res. 70: 140-154 (2016) - 2015
- [j39]Marcos Antonio Pereira
A hybrid method for the Probabilistic Maximal Covering Location-Allocation Problem. Comput. Oper. Res. 57: 51-59 (2015) - [j38]Yasel J. Costa Salas
Clustering Search and Variable Mesh Algorithms for continuous optimization. Expert Syst. Appl. 42(2): 789-795 (2015) - 2014
- [j37]Rômulo Louzada Rabello, Geraldo Regis Mauri
A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem. Eur. J. Oper. Res. 234(3): 802-808 (2014) - [j36]Marcelo Seido Nagano, Augusto Almeida da Silva, Luiz Antonio Nogueira Lorena
An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Syst. Appl. 41(8): 3628-3633 (2014) - [j35]Rudinei Martins de Oliveira, Luiz Antonio Nogueira Lorena
Hybrid heuristics based on column generation with path-relinking for clustering problems. Expert Syst. Appl. 41(11): 5277-5284 (2014) - [c18]Luiz Henrique Nogueira Lorena
Clustering Search Applied to Rank Aggregation. BRACIS 2014: 198-203 - 2013
- [j34]Sóstenes Pereira Gomes, Glaydston Mattos Ribeiro
Dispersion for the point-feature cartographic label placement problem. Expert Syst. Appl. 40(15): 5878-5883 (2013) - 2012
- [j33]Marco Antonio Moreira de Carvalho
New models for the Mirrored Traveling Tournament Problem. Comput. Ind. Eng. 63(4): 1089-1095 (2012) - [j32]Geraldo R. Mauri
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem. Comput. Oper. Res. 39(7): 1577-1581 (2012) - [j31]Marcelo Seido Nagano, Augusto Almeida da Silva, Luiz Antonio Nogueira Lorena
A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng. Appl. Artif. Intell. 25(6): 1114-1120 (2012) - [j30]Geraldo R. Mauri
A column generation approach for the unconstrained binary quadratic programming problem. Eur. J. Oper. Res. 217(1): 69-74 (2012) - [j29]Rudinei Martins de Oliveira, Geraldo R. Mauri
Clustering Search for the Berth Allocation Problem. Expert Syst. Appl. 39(5): 5499-5505 (2012) - [c17]Rudinei Martins de Oliveira, Geraldo R. Mauri
Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem. EvoCOP 2012: 49-62 - 2011
- [j28]Glaydston Mattos Ribeiro
A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields. Comput. Ind. Eng. 60(4): 519-526 (2011) - [j27]Victor Hugo Barros, Tarcísio Souza Costa, Alexandre C. M. Oliveira
Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Comput. Ind. Eng. 60(4): 606-613 (2011) - [j26]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem. Expert Syst. Appl. 38(5): 5013-5018 (2011) - [j25]Geraldo Regis Mauri
Lagrangean decompositions for the unconstrained binary quadratic programming problem. Int. Trans. Oper. Res. 18(2): 257-270 (2011) - [j24]Glaydston Mattos Ribeiro
A lagrangean decomposition for the maximum independent set problem applied to map labeling. Oper. Res. 11(3): 229-243 (2011) - [c16]Geraldo Regis Mauri, Larice Nogueira de Andrade, Luiz Antonio Nogueira Lorena:
A Memetic Algorithm for a Continuous case of the Berth Allocation Problem. IJCCI (ECTA-FCTA) 2011: 105-113 - 2010
- [j23]Edson Luiz França Senne, Marcos Antonio Pereira
A Decomposition Heuristic for the Maximal Covering Location Problem. Adv. Oper. Res. 2010: 120756:1-120756:12 (2010) - [j22]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Clustering search algorithm for the capacitated centered clustering problem. Comput. Oper. Res. 37(3): 552-558 (2010) - [j21]Geraldo R. Mauri
A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem. Comput. Oper. Res. 37(12): 2164-2172 (2010) - [j20]Glaydston Mattos Ribeiro
Strong formulation for the spot 5 daily photograph scheduling problem. J. Comb. Optim. 20(4): 385-398 (2010) - [c15]Tarcísio Souza Costa, Alexandre César Muniz de Oliveira, Luiz Antonio Nogueira Lorena
Advances in Clustering Search. SOCO 2010: 227-235
2000 – 2009
- 2009
- [j19]Francisco de Assis Corrêa, Luiz Antonio Nogueira Lorena
A decomposition approach for the probabilistic maximal covering location-allocation problem. Comput. Oper. Res. 36(10): 2729-2739 (2009) - [j18]Geraldo R. Mauri
Customers' satisfaction in a dial-a-ride problem. IEEE Intell. Transp. Syst. Mag. 1(3): 6-14 (2009) - [c14]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem. Hybrid Metaheuristics 2009: 1-14 - 2008
- [j17]Marcelo Seido Nagano, Rubén Ruiz
A Constructive Genetic Algorithm for permutation flowshop scheduling. Comput. Ind. Eng. 55(1): 195-207 (2008) - [j16]Glaydston Mattos Ribeiro
Lagrangean relaxation with clusters for point-feature cartographic label placement problems. Comput. Oper. Res. 35(7): 2129-2140 (2008) - [j15]Gildásio Lecchi Cravo, Glaydston Mattos Ribeiro
A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput. Geosci. 34(4): 373-386 (2008) - [j14]Glaydston Mattos Ribeiro
Column generation approach for the point-feature cartographic label placement problem. J. Comb. Optim. 15(2): 147-164 (2008) - [j13]Glaydston Mattos Ribeiro
Optimizing the woodpulp stowage using Lagrangean relaxation with clusters. J. Oper. Res. Soc. 59(5): 600-606 (2008) - [c13]Geraldo R. Mauri
A Hybrid Column Generation Approach for the Berth Allocation Problem. EvoCOP 2008: 110-122 - [c12]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem. EvoCOP 2008: 123-134 - [p1]Antonio Augusto Chaves, Francisco de Assis Corrêa, Luiz Antonio Nogueira Lorena
Clustering Search Heuristic for the Capacitated p -Median Problem. Innovations in Hybrid Intelligent Systems 2008: 136-143 - 2007
- [j12]Glaydston Mattos Ribeiro
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem. Comput. Oper. Res. 34(9): 2695-2708 (2007) - [j11]Geraldo R. Mauri, Luiz Antonio Nogueira Lorena:
A new hybrid heuristic for driver scheduling. Int. J. Hybrid Intell. Syst. 4(1): 39-47 (2007) - [j10]Marcos Antonio Pereira
A column generation approach for the maximal covering location problem. Int. Trans. Oper. Res. 14(4): 349-364 (2007) - [j9]Francisco de Assis Corrêa, Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena:
Hybrid heuristics for the probabilistic maximal covering location-allocation problem. Oper. Res. 7(3): 323-343 (2007) - [c11]Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop. Hybrid Metaheuristics 2007: 69-81 - [c10]Fabrício Lacerda Biajoli, Luiz Antonio Nogueira Lorena
Clustering Search Approach for the Traveling Tournament Problem. MICAI 2007: 83-93 - [c9]Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling. MICAI 2007: 1099-1109 - 2006
- [j8]Glaydston Mattos Ribeiro
Heuristics for cartographic label placement problems. Comput. Geosci. 32(6): 739-748 (2006) - [c8]Fabrício Lacerda Biajoli, Luiz Antonio Nogueira Lorena:
Mirrored Traveling Tournament Problem: An Evolutionary Approach. IBERAMIA-SBIA 2006: 208-217 - [c7]Alexandre César Muniz de Oliveira, Luiz Antonio Nogueira Lorena
Pattern Sequencing Problems by Clustering Search. IBERAMIA-SBIA 2006: 218-227 - 2005
- [j7]Edson Luiz França Senne, Luiz Antonio Nogueira Lorena
A branch-and-price approach to p-median location problems. Comput. Oper. Res. 32: 1655-1664 (2005) - [c6]Alexandre César Muniz de Oliveira, Luiz Antonio Nogueira Lorena
Population Training Heuristics. EvoCOP 2005: 166-176 - [c5]Missae Yamamoto, Gilberto Câmara, Luiz Antonio Nogueira Lorena:
Fast Point-Feature Label Placement Algorithm for Real Time Screen Maps. GEOINFO 2005: 122-138 - [c4]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem. HIS 2005: 49-54 - 2004
- [j6]Luiz Antonio Nogueira Lorena
A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6): 863-876 (2004) - [c3]Alexandre César Muniz de Oliveira, Luiz Antonio Nogueira Lorena
Detecting Promising Areas by Evolutionary Clustering Search. SBIA 2004: 385-394 - 2002
- [j5]Luiz Antonio Nogueira Lorena
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems. Eur. J. Oper. Res. 138(3): 473-483 (2002) - [j4]Missae Yamamoto, Gilberto Câmara, Luiz Antonio Nogueira Lorena
Tabu Search Heuristic for Point-Feature Cartographic Label Placement. GeoInformatica 6(1): 77-90 (2002) - [j3]Alexandre César Muniz de Oliveira, Luiz Antonio Nogueira Lorena
A constructive genetic algorithm for gate matrix layout problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(8): 969-974 (2002) - [c2]Alexandre César Muniz de Oliveira, Luiz Antonio Nogueira Lorena
-Opt Population Training for Minimization of Open Stack Problem. SBIA 2002: 313-323 - 2001
- [j2]Luiz Antonio Nogueira Lorena
Constructive Genetic Algorithm for Clustering Problems. Evol. Comput. 9(3): 309-328 (2001) - [c1]Geraldo Ribeiro Filho, Luiz Antonio Nogueira Lorena
A Constructive Evolutionary Approach to School Timetabling. EvoWorkshops 2001: 130-139
1990 – 1999
- 1999
- [j1]Marcelo Gonçalves Narciso, Luiz Antonio Nogueira Lorena
Lagrangean/surrogate relaxation for generalized assignment problems. Eur. J. Oper. Res. 114(1): 165-177 (1999)
Coauthor Index
Antonio Augusto Chaves
aka: Antônio Augusto Chaves
aka: Antônio Augusto Chaves
Geraldo R. Mauri
aka: Geraldo Regis Mauri
aka: Geraldo Regis Mauri
Alexandre César Muniz de Oliveira
aka: Alexandre C. M. Oliveira
aka: Alexandre C. M. Oliveira
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: