Luidi Simonetti

According to our database, Luidi Simonetti authored at least 45 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem with Forfeits.

Gabriel Souto, Masayoshi Aritsugi, Israel Mendonça, Luidi Simonetti, Pedro Henrique González

Proceedings of the IEEE Congress on Evolutionary Computation, 2024

2022

Exact Solution Algorithms for the Chordless Cycle Problem.

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

INFORMS J. Comput., 2022

2021

An ils-based heuristic applied to the car renter salesman problem.

Sávio S. Dias, Luidi Gelabert Simonetti, Luiz Satoru Ochi

RAIRO Oper. Res., 2021

A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem.

Glaubos Clímaco, Luidi Simonetti, Isabel Rosseti

RAIRO Oper. Res., 2021

Optimizing concurrency under Scheduling by Edge Reversal.

Carlos E. Marciano, Gladstone M. Arantes Jr., Abilio Lucena, Luidi Gelabert Simonetti, Luérbio Faria, Felipe M. G. França

Networks, 2021

2020

New proposals for modelling and solving the problem of covering solids using spheres of different radii.

Pedro Henrique González Silva, Ana Flávia Uzeda dos Santos Macambira, Renan Vicente Pinto, Luidi Simonetti, Nelson Maculan, Philippe Michelon

RAIRO Oper. Res., 2020

2019

Distance Transformation for Network Design Problems.

Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa

SIAM J. Optim., 2019

Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem.

Glaubos Clímaco, Isabel Rosseti, Luidi Simonetti, Marcos A. Guerine

Int. Trans. Oper. Res., 2019

A provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows.

Marcos A. Guerine, Murilo B. Stockinger, Isabel Rosseti, Luidi Gelabert Simonetti, Kary A. C. S. Ocaña, Alexandre Plastino, Daniel de Oliveira

Future Gener. Comput. Syst., 2019

New approaches for the traffic counting location problem.

Pedro Henrique González, Glaubos Clímaco, Geraldo Regis Mauri, Bruno Salezze Vieira, Glaydston Mattos Ribeiro, Romulo Dante Orrico Filho, Luidi Simonetti, Leonardo Roberto Perim, Ivone Catarina Simões Hoffmann

Expert Syst. Appl., 2019

A new formulation for the Safe Set problem on graphs.

Ana Flávia Uzeda dos Santos Macambira, Luidi Simonetti, Hugo Barbalho, Pedro Henrique González, Nelson Maculan

Comput. Oper. Res., 2019

Minimum Concurrency for Assembling Computer Music.

Carlos E. Marciano, Abilio Lucena, Felipe M. G. França, Luidi Gelabert Simonetti

Proceedings of the 9th International Network Optimization Conference, 2019

A Biased Random-Key Genetic Algorithm for the Traffic Counting Location Problem.

Glaubos Clímaco, Pedro Henrique González, Glaydston Mattos Ribeiro, Geraldo R. Mauri, Luidi Simonetti

Proceedings of the 8th Brazilian Conference on Intelligent Systems, 2019

2018

Logistics SLA optimization service for transportation in smart cities.

Edcarllos Santos, Puca Huachi Vaz Penna, Igor Machado Coelho, Heder Dorneles Soares, Luiz Satoru Ochi, Luidi Simonetti

Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

2017

Spanning trees with a constraint on the number of leaves. A new formulation.

Luis Gouveia, Luidi Simonetti

Comput. Oper. Res., 2017

2016

On solving manufacturing cell formation via Bicluster Editing.

Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Gelabert Simonetti, Anand Subramanian

Eur. J. Oper. Res., 2016

A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem.

Edcarllos Santos, Luiz Satoru Ochi, Luidi Simonetti, Pedro Henrique González

Electron. Notes Discret. Math., 2016

The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm.

Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha

Electron. Notes Discret. Math., 2016

A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena

Electron. Notes Discret. Math., 2016

A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow.

Pedro Henrique González, Luidi Simonetti, Philippe Michelon, Carlos Alberto de Jesus Martinhon, Edcarllos Santos

Comput. Oper. Res., 2016

Lagrangian heuristics for the Quadratic Knapsack Problem.

Jesus Ossian Cunha, Luidi Simonetti, Abilio Lucena

Comput. Optim. Appl., 2016

2015

Formulations and exact solution approaches for the degree preserving spanning tree problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron

Networks, 2015

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena

Eur. J. Oper. Res., 2015

2014

Integer programming approaches for minimum stabbing problems.

Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti

RAIRO Oper. Res., 2014

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem.

Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

INFORMS J. Comput., 2014

Hybrid heuristics for a short sea inventory routing problem.

Agostinho Agra, Marielle Christiansen, Alexandrino Delgado, Luidi Simonetti

Eur. J. Oper. Res., 2014

A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow.

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon

Proceedings of the Operations Research and Enterprise Systems, 2014

An Improved Relax-and-Fix Algorithm for the Fixed Charge Network Design Problem with User-optimal Flow.

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Edcarllos Santos, Philippe Yves Paul Michelon

Proceedings of the ICORES 2014, 2014

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow.

Pedro Henrique González, Luidi Gelabert Simonetti, Carlos Alberto de Jesus Martinhon, Philippe Yves Paul Michelon, Edcarllos Santos

Proceedings of the ICEIS 2014, 2014

2013

Hop-level flow formulation for the survivable network design with hop constraints problem.

Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa

Networks, 2013

Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem.

Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena

Math. Program., 2013

A New Formulation and Computational Results for the Simple Cycle Problem.

Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

Electron. Notes Discret. Math., 2013

Formulating and Solving the Minimum Dominating Cycle Problem.

Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

Electron. Notes Discret. Math., 2013

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.

Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti

Electron. Notes Discret. Math., 2013

2012

An Intelligent Design Model for Offshore Petroleum Production Elements Layout.

Ana Cristina Bicharra Garcia, Bruno Vieira Guerra, Cristiana Bentes, Luidi Simonetti

Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2012, 2012

2011

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.

Luis Eduardo Neves Gouveia, Luidi Simonetti, Eduardo Uchoa

Math. Program., 2011

New branch-and-bound algorithms for k-cardinality tree problems.

Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza

Electron. Notes Discret. Math., 2011

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.

Luidi Simonetti, Yuri Frota, Cid C. de Souza

Discret. Appl. Math., 2011

The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.

Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena

Proceedings of the Network Optimization - 5th International Conference, 2011

Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.

Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa

Proceedings of the Network Optimization - 5th International Conference, 2011

Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.

Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Reformulations and solution algorithms for the maximum leaf spanning tree problem.

Abilio Lucena, Nelson Maculan, Luidi Simonetti

Comput. Manag. Sci., 2010

2009

Upper and lower bounding procedures for the minimum caterpillar spanning problem.

Luidi Simonetti, Yuri Frota, Cid C. de Souza

Electron. Notes Discret. Math., 2009

An Exact Method for the Minimum Caterpillar Spanning Problem.

Luidi Simonetti, Yuri Frota, Cid C. de Souza

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Bilevel optimization applied to strategic pricing in competitive electricity markets.

Marcia Helena Costa Fampa, Luiz Augusto N. Barroso, D. Candal, Luidi Simonetti

Comput. Optim. Appl., 2008