Luidi Simonetti

According to our database1, Luidi Simonetti authored at least 40 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
New proposals for modelling and solving the problem of covering solids using spheres of different radii.
RAIRO Oper. Res., 2020

2019
Distance Transformation for Network Design Problems.
SIAM J. Optim., 2019

Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem.
Int. Trans. Oper. Res., 2019

A provenance-based heuristic for preserving results confidentiality in cloud-based scientific workflows.
Future Gener. Comput. Syst., 2019

New approaches for the traffic counting location problem.
Expert Syst. Appl., 2019

A new formulation for the Safe Set problem on graphs.
Comput. Oper. Res., 2019

Minimum Concurrency for Assembling Computer Music.
Proceedings of the 9th International Network Optimization Conference, 2019

A Biased Random-Key Genetic Algorithm for the Traffic Counting Location Problem.
Proceedings of the 8th Brazilian Conference on Intelligent Systems, 2019

2018
Logistics SLA optimization service for transportation in smart cities.
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.
Comput. Oper. Res., 2017

2016
On solving manufacturing cell formation via Bicluster Editing.
Eur. J. Oper. Res., 2016

A Hybrid Heuristic based on Iterated Local Search for Multivehicle Inventory Routing Problem.
Electron. Notes Discret. Math., 2016

The Tree-Star Problem: A Formulation and a Branch-and-Cut Algorithm.
Electron. Notes Discret. Math., 2016

A strong symmetric formulation for the Min-degree Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2016

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

Lagrangian heuristics for the Quadratic Knapsack Problem.
Comput. Optim. Appl., 2016

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

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem.
Eur. J. Oper. Res., 2015

2014
Integer programming approaches for minimum stabbing problems.
RAIRO Oper. Res., 2014

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

Hybrid heuristics for a short sea inventory routing problem.
Eur. J. Oper. Res., 2014

A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow.
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.
Proceedings of the ICORES 2014, 2014

A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow.
Proceedings of the ICEIS 2014, 2014

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

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

A New Formulation and Computational Results for the Simple Cycle Problem.
Electron. Notes Discret. Math., 2013

Formulating and Solving the Minimum Dominating Cycle Problem.
Electron. Notes Discret. Math., 2013

The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
Electron. Notes Discret. Math., 2013

2012
An Intelligent Design Model for Offshore Petroleum Production Elements Layout.
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.
Math. Program., 2011

New branch-and-bound algorithms for k-cardinality tree problems.
Electron. Notes Discret. Math., 2011

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm.
Discret. Appl. Math., 2011

The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm.
Proceedings of the Network Optimization - 5th International Conference, 2011

Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Reformulations and solution algorithms for the maximum leaf spanning tree problem.
Comput. Manag. Sci., 2010

2009
Upper and lower bounding procedures for the minimum caterpillar spanning problem.
Electron. Notes Discret. Math., 2009

An Exact Method for the Minimum Caterpillar Spanning Problem.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Bilevel optimization applied to strategic pricing in competitive electricity markets.
Comput. Optim. Appl., 2008


  Loading...