Follow
Quim Castellà
Quim Castellà
Unknown affiliation
Verified email at ed-alumni.net
Title
Cited by
Cited by
Year
Using iterated local search for solving the flow‐shop problem: parallelization, parametrization, and randomization issues
AA Juan, HR Lourenço, M Mateo, R Luo, Q Castella
International Transactions in Operational Research 21 (1), 103-126, 2014
982014
Word storms: Multiples of word clouds for visual comparison of documents
Q Castella, C Sutton
Proceedings of the 23rd international conference on World wide web, 665-676, 2014
842014
Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem
S Gonzalez-Martin, AA Juan, D Riera, Q Castella, R Muñoz, A Perez
AI Communications 25 (2), 173-189, 2012
382012
Systems and methods of address book management
AL Toledo, JAV Sotillo, I Berenguer, JC Vilaseca
US Patent 9,819,768, 2017
242017
ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem
AA Juan, H Ramalhinho Lourenço, M Mateo Doll, Q Castellà, BB Barrios
22012
ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem
BB Barrios, Q Castellà, AA Juan, HR Lourenço, M Mateo
12012
ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem
M Mateo Doll, AA Juan, H Ramalhinho-Lourenço, BB Barrios, Q Castellà
2012
Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem.
M Gavanelli, T Mancini, S González-Martín, AA Juan, D Riera, Q Castellà, ...
AI Communications 25 (2), 2012
2012
ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem
B Barry, Q Castellà, A Angel, HR Lourenco, M Mateo
Barcelona School of Economics Working Papers, 2012
2012
ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem
Q Castellà, HR Lourenco, M Mateo
Barcelona School of Economics, 2012
2012
The system can't perform the operation now. Try again later.
Articles 1–10