A branch-and-cut algorithm for the discrete (r∣p)-centroid problem MC Roboredo, AA Pessoa European Journal of Operational Research 224 (1), 101-109, 2013 | 46 | 2013 |
Measuring the NBA teams’ cross-efficiency by DEA game L Aizemberg, MC Roboredo, TG Ramos, JCCBS de Mello, LA Meza, ... American Journal of Operations Research 4 (03), 101, 2014 | 20 | 2014 |
Data envelopment analysis to evaluate temporal efficiency of Brazilian federal highways that take part on the highways grant program GHI Azevedo, MC Roboredo, L Aizemberg, JQ Silveira, JCCBS Mello Journal of Transport Literature 6 (1), 37-56, 2012 | 20 | 2012 |
The DEA Game Cross Efficiency Model Applied to the Brazilian Football Championship. MC Roboredo, L Aizemberg, LA Meza ITQM, 758-763, 2015 | 18 | 2015 |
Integer programming formulations for three sequential discrete competitive location problems with foresight J Gentile, AA Pessoa, M Poss, MC Roboredo European Journal of Operational Research 265 (3), 872-881, 2018 | 14 | 2018 |
Efficiency evaluation of brazilian electrical distributors using dea game and cluster analysis LG Machado, JCCBS de Mello, MC Roboredo IEEE Latin America Transactions 14 (11), 4499-4505, 2016 | 13 | 2016 |
Solving bilevel combinatorial optimization as bilinear min-max optimization via a branch-and-cut algorithm AA Pessoa, M Poss, MC Roboredo, L Aizemberg Anais do XLV Simpósio Brasileiro de Pesquisa Operacional, 2013 | 11 | 2013 |
A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification H Quadros, MC Roboredo, AA Pessoa Expert Systems with Applications 110, 311-322, 2018 | 9 | 2018 |
An exact approach for the r-interdiction median problem with fortification MC Roboredo, AA Pessoa, L Aizemberg RAIRO-Operations Research 53 (2), 505-516, 2019 | 6 | 2019 |
An exact approach for the r-interdiction covering problem with fortification MC Roboredo, L Aizemberg, AA Pessoa Central European Journal of Operations Research 27 (1), 111-131, 2019 | 6 | 2019 |
Exact methods for the discrete multiple allocation (r| p) hub-centroid problem ACA de Araújo, MC Roboredo, AA Pessoa, V Pereira Computers & Operations Research 116, 104870, 2020 | 4 | 2020 |
Scheduling the Brazilian football league minimizing extended carry-over effects associated to strength groups MC Roboredo, L Aizemberg, AA Pessoa, JCCBS de Mello Engevista 16 (1), 102-110, 2014 | 3 | 2014 |
A branch-and-cut algorithm for a budget constrained centroid problem MC Roboredo, AA Pessoa Anais do XLIV Simpósio Brasileiro de Pesquisa, 2012 | 3 | 2012 |
A DEA model to evaluate Brazilian container terminals EF Costa, LA Meza, MC Roboredo RAIRO-Operations Research 52 (3), 743-754, 2018 | 2 | 2018 |
Medindo a eficiência DEA de times de basquete da NBA: análise temporal da eficiência e enfoque multiobjetivo para obtenção de benchmarks L Aizemberg, TG Ramos, MC Roboredo, GHI de Azevedo, AM Alves, ... Anais do XLIII SBPO 2011, 2011 | 2 | 2011 |
Um algoritmo branch-and-cut para o problema da cobertura máxima competitiva minimizando o maior arrependimento J Gentile, AA Pessoa, MC Roboredo Anais do XLVI Simpósio Brasileiro de Pesquisa Operacional, 2014 | 1 | 2014 |
THE DISCRETE ONE-ROUND VORONOI GAME: OPTIMIZING THE FIRST PLAYER STRATEGY BY INTEGER PROGRAMMING M Roboredo, A Pessoa Simpósio Brasileiro de Pesquisa Operacional, 2011 | 1 | 2011 |
An algorithm to elicitate ELECTRE II, III and IV parameters CM Floriano, V Pereira, MC Roboredo Data Technologies and Applications, 2020 | | 2020 |
UMA ABORDAGEM HEURÍSTICA PARA UM PROBLEMA DE LOCALIZAÇÃO COMPETITIVA DE HUBS M Roboredo, HG Costa | | |
UM ALGORITMO BRANCH-AND-CUT PARA UM PROBLEMA DE LOCALIZAÇÃO DISCRETA COMPETITIVA DE HUBS ACA de Araújo, AA Pessoa, MC Roboredo | | |