Fabrizio Rossi

According to our database1, Fabrizio Rossi authored at least 33 papers between 1997 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Codon optimization by 0-1 linear programming.
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

CATRES: a Context-Aware Recommender System for Indoor and Outdoor Museums Tours Planning.
Proceedings of the Second Workshop on Knowledge-aware and Conversational Recommender Systems, 2019

2017
The Perspectives of DEMO Application to COSO Internal Audit Framework Risks Mitigation.
Proceedings of the Advances in Enterprise Engineering XI, 2017

2016
Leveraging Web Analytics for Automatically Generating Mobile Navigation Models.
Proceedings of the 2016 IEEE International Conference on Mobile Services, MS 2016, San Francisco, CA, USA, June 27, 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

A note on the Cornaz-Jost transformation to solve the graph coloring problem.
Inf. Process. Lett., 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

2012
On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

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
An implicit enumeration scheme for the batch selection problem.
Networks, 2004

Seismic source parameters from InSAR data trough neural networks [trough reads through].
Proceedings of the 2004 IEEE International Geoscience and Remote Sensing Symposium, 2004

2002
Cutting and Reuse: An Application from Automobile Component Manufacturing.
Oper. Res., 2002

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

2000
An optimization problem arising in the design of multiring systems.
Eur. J. Oper. Res., 2000

1997
Batch Scheduling in a Two-machine Flow Shop with Limited Buffer.
Discret. Appl. Math., 1997


  Loading...