| Publication | Date of Publication | Type |
|---|
A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
Computers & Operations Research | 2024-06-25 | Paper |
Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem
International Transactions in Operational Research | 2023-11-23 | Paper |
An adaptive large neighborhood search for the discrete and continuous berth allocation problem
Computers & Operations Research | 2018-07-12 | Paper |
A Lagrangean decomposition for the maximum independent set problem applied to map labeling
Operational Research. An International Journal | 2017-06-29 | Paper |
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
Computers & Operations Research | 2016-11-17 | Paper |
A hybrid method for the probabilistic maximal covering location-allocation problem
Computers & Operations Research | 2016-11-10 | Paper |
A clustering search metaheuristic for the point-feature cartographic label placement problem
European Journal of Operational Research | 2015-02-03 | Paper |
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Computers & Operations Research | 2012-11-15 | Paper |
Clustering search heuristic for solving a continuous Berth Allocation Problem
Evolutionary Computation in Combinatorial Optimization | 2012-10-18 | Paper |
A column generation approach for the unconstrained binary quadratic programming problem
European Journal of Operational Research | 2012-08-16 | Paper |
Lagrangean decompositions for the unconstrained binary quadratic programming problem
International Transactions in Operational Research | 2011-08-17 | Paper |
Strong formulation for the spot 5 daily photograph scheduling problem
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
A decomposition heuristic for the maximal covering location problem
Advances in Operations Research | 2010-11-16 | Paper |
A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
Computers & Operations Research | 2010-09-07 | Paper |
Clustering search algorithm for the capacitated centered clustering problem
Computers & Operations Research | 2009-11-17 | Paper |
A decomposition approach for the probabilistic maximal covering location-allocation problem
Computers & Operations Research | 2009-05-19 | Paper |
Column generation approach for the point-feature cartographic label placement problem
Journal of Combinatorial Optimization | 2008-05-13 | Paper |
Optimizing the woodpulp stowage using Lagrangean relaxation with clusters
The Journal of the Operational Research Society | 2008-05-09 | Paper |
| A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems | 2008-03-20 | Paper |
A column generation approach for the maximal covering location problem
International Transactions in Operational Research | 2008-03-19 | Paper |
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
Computers & Operations Research | 2008-01-23 | Paper |
A new hybrid heuristic for driver scheduling
International Journal of Hybrid Intelligent Systems | 2007-07-24 | Paper |
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
Computers & Operations Research | 2007-04-13 | Paper |
Evolutionary Computation in Combinatorial Optimization
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Advances in Artificial Intelligence – SBIA 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
School location methodology in urban areas of developing countries
International Transactions in Operational Research | 2005-03-30 | Paper |
A branch-and-price approach to p-median location problems
Computers & Operations Research | 2005-02-22 | Paper |
A column generation approach to capacitated \(p\)-median problems
Computers & Operations Research | 2004-06-15 | Paper |
| scientific article; zbMATH DE number 2014735 (Why is no real title available?) | 2003-12-08 | Paper |
scientific article; zbMATH DE number 1870079 (Why is no real title available?)
GeoInformatica | 2003-02-17 | Paper |
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
European Journal of Operational Research | 2002-06-16 | Paper |
| scientific article; zbMATH DE number 1703856 (Why is no real title available?) | 2002-02-13 | Paper |
| scientific article; zbMATH DE number 1383814 (Why is no real title available?) | 2001-12-05 | Paper |
Lagrangean/surrogate relaxation for generalized assignment problems
European Journal of Operational Research | 1999-11-25 | Paper |
Relaxation heuristics for a generalized assignment problem
European Journal of Operational Research | 1999-11-10 | Paper |
Genetic algorithms applied to computationally difficult set covering problems
The Journal of the Operational Research Society | 1998-05-25 | Paper |
| scientific article; zbMATH DE number 1070396 (Why is no real title available?) | 1997-10-05 | Paper |
A surrogate heuristic for set covering problems
European Journal of Operational Research | 1995-01-11 | Paper |
