Stefano Smriglio

Orcid: 0000-0001-8152-003X

According to our database1, Stefano Smriglio authored at least 32 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs.
CoRR, 2024

2023
Comparing deep and shallow neural networks in forecasting call center arrivals.
Soft Comput., 2023

Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept.
Proceedings of the 36th IEEE International Symposium on Computer-Based Medical Systems, 2023

2022
Optimizing Nozzle Travel Time in Proton Therapy.
Proceedings of the 35th IEEE International Symposium on Computer-Based Medical Systems, 2022

2021
Orbital Conflict: Cutting Planes for Symmetric Integer Programs.
INFORMS J. Optim., January, 2021

A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout.
Proceedings of the Operations Research and Enterprise Systems, 2021

2020
The stable set problem: Clique and nodal inequalities revisited.
Comput. Oper. Res., 2020

2019
Computational study of separation algorithms for clique inequalities.
Soft Comput., 2019

Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks.
Algorithms, 2019

2016
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms.
SIAM J. Optim., 2015

2014
Robust Shift Scheduling in Call Centers.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Strong lift-and-project cutting planes for the stable set problem.
Math. Program., 2013

Approximating the Lovász θ Function with the Subgradient Method.
Electron. Notes Discret. Math., 2013

The Shortest Walk to Watch TV.
Proceedings of the Power of Algorithms - Inspiration and Examples in Everyday Life, 2013

2011
Solving large Steiner Triple Covering Problems.
Oper. Res. Lett., 2011

Orbital branching.
Math. Program., 2011

A Lagrangian heuristic for satellite range scheduling with resource constraints.
Comput. Oper. Res., 2011

A New Approach to the Stable Set Problem Based on Ellipsoids.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Routing Concurrent Video Signals over SDH Networks.
Electron. Notes Discret. Math., 2010

2009
An application of the Lovász-Schrijver <i>M</i>(<i>K</i>, <i>K</i>) operator to the stable set problem.
Math. Program., 2009

2008
Time offset optimization in digital broadcasting.
Discret. Appl. Math., 2008

Constraint Orbital Branching.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008

2007
Annals of OR - Special volume in memory of Mario Lucertini.
Ann. Oper. Res., 2007

2006
The Network Packing Problem in Terrestrial Broadcasting.
Oper. Res., 2006

2004
A competitive scheduling problem and its relevance to UMTS channel assignment.
Networks, 2004

An implicit enumeration scheme for the batch selection problem.
Networks, 2004

2001
A branch-and-cut algorithm for the maximum cardinality stable set problem.
Oper. Res. Lett., 2001

A set packing model for the ground holding problem in congested networks.
Eur. J. Oper. Res., 2001

Models and Algorithms for Terrestrial Digital Broadcasting.
Ann. Oper. Res., 2001

1999
A Three-dimensional Matching Model for Perishable Production Scheduling.
Discret. Appl. Math., 1999


  Loading...