Luidi Gelabert Simonetti
Luidi Gelabert Simonetti
Programa de Engenharia de Sistemas e Computação, Universidade Federal do Rio de Janeiro
Verified email at - Homepage
Cited by
Cited by
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
L Gouveia, L Simonetti, E Uchoa
Mathematical Programming 128 (1), 123-148, 2011
Bilevel optimization applied to strategic pricing in competitive electricity markets
M Fampa, LA Barroso, D Candal, L Simonetti
Computational Optimization and Applications 39 (2), 121-142, 2008
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
B Gendron, A Lucena, AS da Cunha, L Simonetti
INFORMS Journal on Computing 26 (4), 645-657, 2014
Hybrid heuristics for a short sea inventory routing problem
A Agra, M Christiansen, A Delgado, L Simonetti
European Journal of Operational Research 236 (3), 924-935, 2014
Reformulations and solution algorithms for the maximum leaf spanning tree problem
A Lucena, N Maculan, L Simonetti
Computational Management Science 7 (3), 289-311, 2010
The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm
L Simonetti, AS Da Cunha, A Lucena
International Conference on Network Optimization, 162-169, 2011
A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
E Santos, LS Ochi, L Simonetti, PH González
Electronic Notes in Discrete Mathematics 52, 197-204, 2016
Optimizing the petroleum supply chain at Petrobras
M Aires, A Lucena, R Rocha, C Santiago, L Simonetti
Computer Aided Chemical Engineering 18, 871-876, 2004
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
L Simonetti, Y Frota, CC de Souza
Discrete applied mathematics 159 (16), 1901-1914, 2011
On solving manufacturing cell formation via bicluster editing
RGS Pinheiro, IC Martins, F Protti, LS Ochi, LG Simonetti, A Subramanian
European Journal of Operational Research 254 (3), 769-779, 2016
Modelling the hop-constrained minimum spanning tree problem over a layered graph
L Gouveia, L Simonetti, E Uchoa
International Network Optimization Conference, 2007
Hop‐level flow formulation for the survivable network design with hop constraints problem
AR Mahjoub, L Simonetti, E Uchoa
Networks 61 (2), 171-179, 2013
New approaches for the traffic counting location problem
PH González, G Clímaco, GR Mauri, BS Vieira, GM Ribeiro, ...
Expert systems with applications 132, 189-198, 2019
A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow
PH Gonzalez, L Simonetti, P Michelon, C Martinhon, E Santos
Computers & Operations Research 76, 134-146, 2016
Heurísticas para o problema de localização de contadores de tráfego em redes de transporte
PH González, G Clímaco, L Simonetti, HA Gomes, GM Ribeiro
Anais do XXX ANPET, 2016
Lagrangian heuristics for the quadratic knapsack problem
JO Cunha, L Simonetti, A Lucena
Computational Optimization and Applications 63 (1), 97-120, 2016
Polyhedral results and a Branch-and-cut algorithm for the -cardinality tree problem
L Simonetti, AS Da Cunha, A Lucena
Mathematical Programming 142 (1), 511-538, 2013
A new formulation and computational results for the simple cycle problem
A Lucena, AS da Cunha, L Simonetti
Electronic Notes in Discrete Mathematics 44, 83-88, 2013
Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário
PH González, C Martinhon, LG Simonetti, E Santos, PYP Michelon
XLV Simpósio Brasileiro de Pesquisa Operacional, Natal, 2013
New branch-and-bound algorithms for k-cardinality tree problems
L Simonetti, F Protti, Y Frota, CC de Souza
Electronic Notes in Discrete Mathematics 37, 27-32, 2011
The system can't perform the operation now. Try again later.
Articles 1–20