The following pages link to Luiz Antonio Nogueira Lorena (Q439326):
Displaying 40 items.
- (Q337481) (redirect page) (← links)
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- A decomposition heuristic for the maximal covering location problem (Q606191) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
- A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
- Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
- (Q1278256) (redirect page) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem (Q1651633) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
- Column generation approach for the point-feature cartographic label placement problem (Q2427437) (← links)
- Lagrangean relaxation with clusters for point-feature cartographic label placement problems (Q2468473) (← links)
- A clustering search metaheuristic for the point-feature cartographic label placement problem (Q2514783) (← links)
- (Q2770496) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem (Q3164904) (← links)
- (Q4356873) (← links)
- Genetic algorithms applied to computationally difficult set covering problems (Q4363748) (← links)
- (Q4438009) (← links)
- School location methodology in urban areas of developing countries (Q4662765) (← links)
- (Q4719356) (← links)
- (Q4792796) (← links)
- A new hybrid heuristic for driver scheduling (Q5294242) (← links)
- Advances in Artificial Intelligence – SBIA 2004 (Q5311224) (← links)
- Optimizing the woodpulp stowage using Lagrangean relaxation with clusters (Q5387397) (← links)
- (Q5447760) (← links)
- A column generation approach for the maximal covering location problem (Q5449883) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5706007) (← links)
- Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem (Q6092543) (← links)
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems (Q6561237) (← links)
