default search action
Stefano Smriglio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Federico Battista, Fabrizio Rossi, Stefano Smriglio:
Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs. CoRR abs/2407.19290 (2024) - 2023
- [j22]Andrea Manno
, Fabrizio Rossi
Comparing deep and shallow neural networks in forecasting call center arrivals. Soft Comput. 27(18): 12943-12957 (2023) - [c9]Matteo Spezialetti, Ramon Gimenez De Lorenzo, Giovanni Luca Gravina, Giuseppe Placidi, Fabrizio Rossi
Spread-Out Bragg Peak in Treatment Planning System by Mixed Integer Linear Programming: a Proof of Concept. CBMS 2023: 548-554 - 2022
- [c8]Matteo Spezialetti, Renata Di Filippo, Ramon Gimenez De Lorenzo
Optimizing Nozzle Travel Time in Proton Therapy. CBMS 2022: 441-446 - 2021
- [j21]Jeff T. Linderoth
Orbital Conflict: Cutting Planes for Symmetric Integer Programs. INFORMS J. Optim. 3(2): 139-153 (2021) - [c7]Claudio Arbib
A MIP-Based Heuristic for Pickup and Delivery on Rectilinear Layout. ICORES (Selected Papers) 2021: 211-226 - [c6]Claudio Arbib, Fatemeh K. Ranjbar, Stefano Smriglio:
A Dynamic Dial-a-ride Model for Optimal Vehicle Routing in a Wafer Fab. ICORES 2021: 281-286 - 2020
- [j20]Adam N. Letchford, Fabrizio Rossi
The stable set problem: Clique and nodal inequalities revisited. Comput. Oper. Res. 123: 105024 (2020)
2010 – 2019
- 2019
- [j19]Alessandro Agnetis, Fabrizio Rossi
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks. Algorithms 12(12): 250 (2019) - [j18]Francesca Marzi
Computational study of separation algorithms for clique inequalities. Soft Comput. 23(9): 3013-3027 (2019) - 2016
- [c5]Adam N. Letchford
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem. ISCO 2016: 201-212 - 2015
- [j17]Monia Giandomenico, Adam N. Letchford
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms. SIAM J. Optim. 25(3): 1944-1963 (2015) - 2014
- [c4]Sara Mattia, Fabrizio Rossi
Robust Shift Scheduling in Call Centers. ISCO 2014: 336-346 - 2013
- [j16]Monia Giandomenico, Adam N. Letchford
Approximating the Lovász θ Function with the Subgradient Method. Electron. Notes Discret. Math. 41: 157-164 (2013) - [j15]Monia Giandomenico, Fabrizio Rossi
Strong lift-and-project cutting planes for the stable set problem. Math. Program. 141(1-2): 165-192 (2013) - [p1]Fabrizio Rossi
The Shortest Walk to Watch TV. The Power of Algorithms 2013: 187-205 - 2011
- [j14]Fabrizio Marinelli
A Lagrangian heuristic for satellite range scheduling with resource constraints. Comput. Oper. Res. 38(11): 1572-1583 (2011) - [j13]James Ostrowski
Orbital branching. Math. Program. 126(1): 147-178 (2011) - [j12]James Ostrowski
Solving large Steiner Triple Covering Problems. Oper. Res. Lett. 39(2): 127-131 (2011) - [c3]Monia Giandomenico, Adam N. Letchford
A New Approach to the Stable Set Problem Based on Ellipsoids. IPCO 2011: 223-234 - 2010
- [j11]Monia Giandomenico, Fabrizio Rossi
Routing Concurrent Video Signals over SDH Networks. Electron. Notes Discret. Math. 36: 767-774 (2010)
2000 – 2009
- 2009
- [j10]Monia Giandomenico, Adam N. Letchford
An application of the Lovász-Schrijver M(K, K) operator to the stable set problem. Math. Program. 120(2): 381-401 (2009) - 2008
- [j9]Carlo Mannino, Fabrizio Rossi
Time offset optimization in digital broadcasting. Discret. Appl. Math. 156(3): 339-351 (2008) - [c2]James Ostrowski
Constraint Orbital Branching. IPCO 2008: 225-239 - 2007
- [j8]Claudio Arbib
Annals of OR - Special volume in memory of Mario Lucertini. Ann. Oper. Res. 150(1): 1 (2007) - [c1]James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi
Orbital Branching. IPCO 2007: 104-118 - 2006
- [j7]Carlo Mannino, Fabrizio Rossi
The Network Packing Problem in Terrestrial Broadcasting. Oper. Res. 54(4): 611-626 (2006) - 2004
- [j6]Claudio Arbib
A competitive scheduling problem and its relevance to UMTS channel assignment. Networks 44(2): 132-141 (2004) - [j5]Alessandro Agnetis
An implicit enumeration scheme for the batch selection problem. Networks 44(2): 151-159 (2004) - 2001
- [j4]Fabrizio Rossi
Models and Algorithms for Terrestrial Digital Broadcasting. Ann. Oper. Res. 107(1-4): 267-283 (2001) - [j3]Fabrizio Rossi
A set packing model for the ground holding problem in congested networks. Eur. J. Oper. Res. 131(2): 400-416 (2001) - [j2]Fabrizio Rossi
A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper. Res. Lett. 28(2): 63-74 (2001)
1990 – 1999
- 1999
- [j1]Claudio Arbib
A Three-dimensional Matching Model for Perishable Production Scheduling. Discret. Appl. Math. 92(1): 1-15 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: