Lorena Luiz Antonio Nogueira

Luiz Antonio Nogueira Lorena

Information about the author Luiz Antonio Nogueira Lorena will soon be added to the site.
Found 16 papers in total
A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem
A Clustering Search metaheuristic for the Point-Feature Cartographic Label Placement Problem
2014
The Point‐Feature Cartographic Label Placement (PFCLP) problem consists of...
New models for the Mirrored Traveling Tournament Problem
New models for the Mirrored Traveling Tournament Problem
2012
The Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial...
A column generation approach for the unconstrained binary quadratic programming problem
A column generation approach for the unconstrained binary quadratic programming problem
2012
This paper proposes a column generation approach based on the Lagrangean relaxation...
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
2012
This paper presents a new alternative of Lagrangian decomposition based on column...
Lagrangean decompositions for the unconstrained binary quadratic programming problem
Lagrangean decompositions for the unconstrained binary quadratic programming problem
2011
The unconstrained binary quadratic programming problem (QP) is a classical non-linear...
A decomposition heuristic for the maximal covering location problem
A decomposition heuristic for the maximal covering location problem
2010
This paper proposes a cluster partitioning technique to calculate improved upper...
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
2007
The Maximal Covering Location Problem (MCLP) maximizes the population that has a...
Location of elementary schools with capacity and non-capacity models: case of the city of Victoria/ES
Location of elementary schools with capacity and non-capacity models: case of the city of Victoria/ES
2004
The present study is divided in three parts. In the first part, the objective of the...
The Lagrangean relaxation/surrogate and the method of generating columns: new limitations and new columns
The Lagrangean relaxation/surrogate and the method of generating columns: new limitations and new columns
2003
Column generation and Dantzig–Wolfe decomposition are very successful methods...
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
2007
We consider in this paper a new Lagrangean relaxation with clusters for the...
A column generation approach for the maximal covering location problem
A column generation approach for the maximal covering location problem
2007
This article presents a column generation algorithm to calculate new improved lower...
A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillsman's edition
A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillsman's edition
2002
The Maximal Covering Location Problem (MCLP) deals with the location of the facilities...
School location methodology in urban areas of developing countries
School location methodology in urban areas of developing countries
2004
This study is concerned with the location of primary public schools. The public system...
A surrogate heuristic for set covering problems
A surrogate heuristic for set covering problems
1994
The purpose of this paper is to present a new heuristic for set covering problems,...
Facility layout optimization using tabu search
Facility layout optimization using tabu search
1997
The search for high quality facility layouts can be viewed as combinatorial...
Computational experiments with genetic algorithms applied to set covering problems
Computational experiments with genetic algorithms applied to set covering problems
1996
Genetic algorithms (GA) are a class of iteration procedures that simulate the...
Papers per page: