Luidi Gelabert Simonetti
Instituição:
Universidade Federal do Rio de Janeiro
Centro:
Centro de Tecnologia
Unidade:
Escola Politécnica
Departamento:
Departamento de Engenharia Computação e Informação/Poli
Formação:
-
Universidade Estadual de Campinas
| Pós-Doutorado | 2008 - 2010
-
Universidade Federal do Rio de Janeiro
Engenharia de Sistemas e Computação | Doutorado | 2004 - 2008
-
Universidade Federal do Rio de Janeiro
Engenharia de Sistemas e Computação | Mestrado | 2001 - 2003
-
Universidade Federal do Rio de Janeiro
Engenharia Mecânica | Graduação | 1996 - 2000
Laboratórios:
- LabOtim
Nuvens de Palavras:
Artigos:
(100.00% artigos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| New approaches for the prize-collecting covering tour problem | 10.1504/ijise.2023.133526 | 2023 |
| Exact Solution Algorithms for the Chordless Cycle Problem | 10.1287/ijoc.2022.1164 | 2022 |
| Optimizing concurrency under Scheduling by Edge Reversal | 10.1002/net.22014 | 2021 |
| An ils-based heuristic applied to the car renter salesman problem | 10.1051/ro/2020053 | 2021 |
| A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem | 10.1051/ro/2020002 | 2021 |
| New proposals for modelling and solving the problem of covering solids using spheres of different radii | 10.1051/ro/2019041 | 2020 |
| A provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows | 10.1016/j.future.2019.01.051 | 2019 |
| Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem | 10.1111/itor.12563 | 2019 |
| DISTANCE TRANSFORMATION FOR NETWORK DESIGN PROBLEMS | 10.1137/16M1108261 | 2019 |
| New approaches for the traffic counting location problem | 10.1016/j.eswa.2019.04.068 | 2019 |
| A new formulation for the Safe Set problem on graphs | 10.1016/j.cor.2019.07.004 | 2019 |
| Spanning Trees with a constraint on the number of leaves. A new formulation | 10.1016/j.cor.2016.12.005 | 2017 |
| Lagrangian heuristics for the Quadratic Knapsack Problem | 10.1007/s10589-015-9763-3 | 2016 |
| On solving manufacturing cell formation via Bicluster Editing | 10.1016/j.ejor.2016.05.010 | 2016 |
| A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow | 10.1016/j.cor.2016.06.016 | 2016 |
| Formulations and exact solution approaches for the degree preserving spanning tree problem | 10.1002/net.21590 | 2015 |
| Optimality cuts and a Branch-and-cut algorithm for the K − rooted Mini-Max Spanning Forest Problem | 10.1016/j.ejor.2015.05.001 | 2015 |
| Integer programming approaches for minimum stabbing problems | 10.1051/ro/2014008 | 2014 |
| Hybrid heuristics for a maritime short sea inventory routing problem | 10.1016/j.ejor.2013.06.042 | 2014 |
| Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem | 10.1287/ijoc.2013.0589 | 2014 |
| Hop-Level Flow Formulation for the Survivable Network Design with Hop Constraints Problem | 10.1002/net.21483 | 2013 |
| Polyhedral Results and a Branch-and-cut Algorithm for the k-Cardinality Tree Problem | 10.1007/s10107-012-0590-3 | 2013 |
| Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs | 10.1007/s10107-009-0297-2 | 2011 |
| The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm | 10.1016/j.dam.2011.01.015 | 2011 |
| Reformulations and solution algorithms for the maximum leaf spanning tree problem | 10.1007/s10287-009-0116-5 | 2010 |
| Bilevel optimization applied to strategic pricing in competitive electricity markets | 10.1007/s10589-007-9066-4 | 2008 |
Eventos:
(12.35% eventos com DOI)
| Titulo | DOI | Ano |
|---|---|---|
| A new branch and price algorithm for the Stop Number Minimization Problem | 2022 | |
| Lagrangian Relaxations of Constrained Spanning Forests | 2022 | |
| Captura de Fluxo Evasivo via Decomposição de Benders | 2021 | |
| AIISR - AI INSPIRED STOPPING RULE FOR GRASP METAHEURISTIC | 2021 | |
| Minimum Concurrency for Assembling Computer Music | 10.5441/002/inoc.2019.16 | 2019 |
| GRASP Híbrido para Resolução do Problema de Localização de Facilidades Capacitadas em Dois Níveis | 2019 | |
| A biased random-key genetic algorithm for the traffic counting location problem | 10.1109/BRACIS.2019.00056 | 2019 |
| An overview of the supply chain logistics with a limited autonomy vehicle problem | 2018 | |
| A new model and a Branch and Cut algorithm for the Safe Set problem on graphs | 2018 | |
| A Branch-and-Cut Approach for the Car Renter Sales- man Problem | 2018 | |
| Accelerating Dual Dynamic Programming for Stochastic Hydrothermal Coordination Problems | 10.23919/PSCC.2018.8442829 | 2018 |
| New proposals for the Problem of Covering Solids using Spheres of Different Radii | 2018 | |
| Logistics SLA optimization service for transportation in smart cities | 10.1109/ijcnn.2018.8489344 | 2018 |
| Towards the Optimization of Graph Tessellation Covers | 2018 | |
| The capacitated minimum weighted rooted arborescence problem | 2017 | |
| Distance transformation for network design problems | 2017 | |
| New Insights on Prize Collecting Path Problems | 2017 | |
| An optimization model for the safe set problem on graphs | 2017 | |
| Distance transformation for network design problems | 2017 | |
| A branch-and-cut algorithm and heuristics for the maximum weight spanning star forest problem | 2017 | |
| Um algoritmo Branch-and-Cut para o problema de Localização Ótima de Contadores de Tráfego em Redes de Transporte | 2017 | |
| BRKGA com população mista aplicado ao problema de localização de contadores de tráfego em redes de transporte | 2017 | |
| Uma Nova Abordagem para o Problema de Recobrimento de Sólidos com Esferas de Diferentes Raios | 2016 | |
| Uma Heurística Baseada em ILS Para o Problema do Caixeiro Alugador | 2016 | |
| Heurísticas para o problema da Árvore Geradora de Custo Mínimo com k folhas | 2016 | |
| Uma Heurística Híbrida baseada em Iterated Local Search para o Problema de Estoque e Roteamento de Múltiplos Veículos | 2016 | |
| Distance Transformation for Network Design Problems | 2016 | |
| HEURÍSTICAS PARA O PROBLEMA DE LOCALIZAÇÃO DE CONTADORES DE TRÁFEGO EM REDES DE TRANSPORTE | 2016 | |
| A Study on the Transmission Expansion Planning Problem with Redesign | 2015 | |
| The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm | 10.1016/j.endm.2016.03.038 | 2015 |
| A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem | 10.1016/j.endm.2016.03.031 | 2015 |
| A new model for maximum leaf spanning tree problem | 2015 | |
| A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem | 10.1016/j.endm.2016.03.026 | 2015 |
| An ILS algorithm for the Robust Coloring Problem | 2015 | |
| Estudo de Metódos Exatos para o Problema de Expansão de Redes de Transmissão de Energia Elétrica com Redimensionamento | 2015 | |
| Um Método de Pós-Otimização para o Problema de Síntese de Redes a 2- caminhos | 2015 | |
| An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow | 10.5220/0004832601000107 | 2014 |
| A Study on the Fixed Charge Network Design Problem with User-optimal Flow | 2014 | |
| A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow | 10.5220/0004885903840394 | 2014 |
| Um algoritmo Branch-and-Cut para o Problema da Mochila Quadrática 0-1 | 2014 | |
| UMA ABORDAGEM DE MATHEURÍSTICA PARA O PROBLEMA BIOBJETIVO DE ROTEAMENTO EM ARCOS CAPACITADOS | 2014 | |
| A Relax-and-Cut Algorithm for Generating Upper and Lower Bounds for the Quadratic Knapsack Problem | 2014 | |
| A matheuristic for the bi-objective arc routing problem | 2014 | |
| A New Formulation and Computational Results for the Simple Cycle Problem | 2013 | |
| Posicionamento de Réplicas em Redes de Distribuição de Conteúdos | 2013 | |
| Enhanced dynamic programming algorithms for the constrained subtree of a tree problem | 2013 | |
| The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method | 2013 | |
| Formulating and Solving the Minimum Dominating Cycle Problem | 2013 | |
| Uma Metaheurística GRASP para o Problema de Planejamento de Redes com Rotas Ótimas para o Usuário | 2013 | |
| Um algoritmo exato para uma classe de problemas de programação linear-fracionária | 2013 | |
| An intelligent design model for offshore petroleum production elements layout | 2012 | |
| Métodos Exatos e Heurísticos para Biclusterização em Grafos | 2012 | |
| A Distributed Transportation Simplex Applied to a Content Distribution Network Problem | 2012 | |
| A Branch and Cut Algorithm for the Minimum Connected Dominating Set Problem | 2011 | |
| Formulations and Branch-and-cut algorithm for the K-rooted Mini-Max Spanning Forest Problem | 2011 | |
| The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-cut algorithm. | 2011 | |
| Posicionamento de Réplicas em Redes de Distribuição de Conteúdos | 2011 | |
| Uma Heurística Distribuída para o Problema de Atribuição de Clientes a Servidores em Redes de Distribuição de Conteúdos | 2011 | |
| Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem | 2011 | |
| New branch-and-bound algorithms for k-cardinality tree problems | 2011 | |
| Reformulations and Solution Algorithms for the Maximum Leaf Spanning Tree Problem | 2010 | |
| Upper and Lower Bounds for the Symmetric Uncapacitated Traveling Purchaser Problem | 2010 | |
| Reformulations and Solution Algorithms for the Maximum Leaf Spanning Tree Problem | 2009 | |
| A Branch and Cut Algorithm for the Minimum Span Frequency Assignment Problem | 2009 | |
| An exact method for the minimum caterpillar spanning problem | 2009 | |
| An exact method for the minimum caterpillar spanning problem | 2009 | |
| A Branch-and-Cut Algorithm for the Ring Star Problem | 2009 | |
| A Branch and Cut Algorithm for the Minimum Connected Dominating Set Problem | 2009 | |
| Exact Solution Algorithms for Maximum Leaf Spanning Tree and Minimum Connected Dominating Set Problems | 2009 | |
| Upper and lower bounding procedures for the minimum caterpillar spanning problem | 2009 | |
| Dual-Ascent Distribuído para Multicast com Restrição de Saltos | 2008 | |
| Reformulations and Solution Algorithms for the Max-Leaf Spanning Tree Problem | 2008 | |
| Modelling the hop-constrained minimum spanning tree problem over a layered graph | 2007 | |
| Modelling the hop-constrained minimum spanning tree problem over a layered graph | 2006 | |
| Short-term production planning in oil refineries: two mixed integer programming models | 2006 | |
| Optimizing the Petroleum Supply Chain at Petrobras | 10.1016/S1570-7946(04)80211-6 | 2004 |
| Strategic pricing in competitive electricity markets | 2004 | |
| Modeling and solving the stochastic taxation problem | 2004 | |
| Geração de Colunas para o problema de empocotamento de árvores de Steiner | 2003 | |
| A bilevel model and solution algorithm for the stochastic taxation problem | 2003 | |
| Geometrical efficient cuts in integer 0-1 programming | 2001 |