Person:247013: Difference between revisions

From MaRDI portal
Person:247013
m AuthorDisambiguator moved page Luidi Simonetti to Luidi Simonetti: Duplicate
Created automatically from import240128110107
 
Line 1: Line 1:
{{Person}}
{{person}}

Latest revision as of 12:29, 28 January 2024

Available identifiers

zbMath Open simonetti.luidi-gMaRDI QIDQ247013

List of research outcomes





PublicationDate of PublicationType
Optimizing concurrency under Scheduling by Edge Reversal2023-12-11Paper
Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem2023-11-27Paper
A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem2021-07-27Paper
An ils-based heuristic applied to the car renter salesman problem2021-07-27Paper
New proposals for modelling and solving the problem of covering solids using spheres of different radii2020-05-13Paper
A new formulation for the safe set problem on graphs2019-09-25Paper
Distance Transformation for Network Design Problems2019-08-27Paper
Spanning trees with a constraint on the number of leaves. A new formulation2018-07-11Paper
A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow2016-11-17Paper
A hybrid heuristic based on iterated local search for multivehicle inventory routing problem2016-10-18Paper
On solving manufacturing cell formation via bicluster editing2016-10-07Paper
Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem2016-10-06Paper
Lagrangian heuristics for the quadratic knapsack problem2016-03-07Paper
Hybrid heuristics for a short sea inventory routing problem2015-02-03Paper
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem2015-01-26Paper
Integer programming approaches for minimum stabbing problems2014-05-26Paper
Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem2014-02-03Paper
Hop‐level flow formulation for the survivable network design with hop constraints problem2013-08-06Paper
New branch-and-bound algorithms for k-cardinality tree problems2013-07-23Paper
Upper and lower bounding procedures for the minimum caterpillar spanning problem2013-07-19Paper
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm2011-10-27Paper
Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem2011-09-09Paper
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs2011-06-17Paper
Reformulations and solution algorithms for the maximum leaf spanning tree problem2010-09-20Paper
Bilevel optimization applied to strategic pricing in competitive electricity markets2008-04-03Paper

Research outcomes over time

This page was built for person: Luidi Simonetti