default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRosario Scatamacchia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Gabriele Dragotto
, Rosario Scatamacchia:
The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. INFORMS J. Comput. 35(5): 1143-1160 (2023)- [i9]Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia:
ITERATED INSIDE OUT: a new exact algorithm for the transportation problem. CoRR abs/2302.10826 (2023) - 2022
- [j20]Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia:
On fairness and diversification in WTA and ATP tennis tournaments generation. Ann. Oper. Res. 316(2): 1107-1119 (2022) - [j19]Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia:
Improved solution of the Budget constrained Fuel Treatment Scheduling problem and extensions. Comput. Ind. Eng. 168: 108139 (2022) - [j18]Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri:
The Connected Critical Node Problem. Theor. Comput. Sci. 923: 235-255 (2022) - 2021
- [j17]Arianna Alfieri, Shuyu Zhou, Rosario Scatamacchia, Steef L. van de Velde:
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. 4OR 19(2): 265-288 (2021) - [j16]David Pisinger, Rosario Scatamacchia:
The Baggage Belt Assignment Problem. EURO J. Transp. Logist. 10: 100041 (2021) - [i8]Gabriele Dragotto, Rosario Scatamacchia:
ZERO Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. CoRR abs/2111.06382 (2021) - 2020
- [j15]Federico Della Croce, Rosario Scatamacchia:
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Math. Program. 183(1): 249-281 (2020) - [j14]Pierre Hosteins, Rosario Scatamacchia:
The stochastic critical node problem over trees. Networks 76(3): 381-401 (2020) - [j13]Federico Della Croce, Rosario Scatamacchia:
The Longest Processing Time rule for identical parallel machines revisited. J. Sched. 23(2): 163-176 (2020) - [i7]Federico Della Croce, Marco Ghirardi, Rosario Scatamacchia:
An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem. CoRR abs/2005.06225 (2020) - [i6]David Pisinger, Rosario Scatamacchia:
The Baggage Belt Assignment Problem. CoRR abs/2006.03365 (2020)
2010 – 2019
- 2019
- [j12]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discret. Appl. Math. 253: 103-121 (2019) - [j11]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
New exact approaches and approximation results for the Penalized Knapsack Problem. Discret. Appl. Math. 253: 122-135 (2019) - [j10]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
On approximating the Incremental Knapsack Problem. Discret. Appl. Math. 264: 26-42 (2019) - [j9]Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt:
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem. J. Comb. Optim. 38(2): 608-617 (2019) - [c2]Federico Della Croce, Rosario Scatamacchia:
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints. IPCO 2019: 155-167 - 2018
- [j8]Ulrich Pferschy, Rosario Scatamacchia:
Improved dynamic programming and approximation results for the knapsack problem with setups. Int. Trans. Oper. Res. 25(2): 667-682 (2018) - [j7]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the 3-period Incremental Knapsack Problem. J. Discrete Algorithms 52-53: 55-69 (2018) - [i5]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximating the Incremental Knapsack Problem. CoRR abs/1801.04801 (2018) - [i4]Federico Della Croce, Rosario Scatamacchia:
Longest Processing Time rule for identical parallel machines revisited. CoRR abs/1801.05489 (2018) - [i3]Federico Della Croce, Rosario Scatamacchia:
A new exact approach for the Bilevel Knapsack with Interdiction Constraints. CoRR abs/1811.02822 (2018) - [i2]Pierre Hosteins, Rosario Scatamacchia:
The Stochastic Critical Node Problem over Trees. CoRR abs/1812.06456 (2018) - 2017
- [b1]Rosario Scatamacchia:
Knapsack Problems with Side Constraints. Polytechnic University of Turin, Italy, 2017 - [j6]Federico Della Croce, Fabio Salassa, Rosario Scatamacchia:
An exact approach for the 0-1 knapsack problem with setups. Comput. Oper. Res. 80: 61-67 (2017) - [j5]Federico Della Croce, Fabio Salassa, Rosario Scatamacchia:
A new exact approach for the 0-1 Collapsing Knapsack Problem. Eur. J. Oper. Res. 260(1): 56-69 (2017) - [c1]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Approximation Results for the Incremental Knapsack Problem. IWOCA 2017: 75-87 - [i1]Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia:
Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. CoRR abs/1702.04211 (2017) - 2016
- [j4]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
A general Evolutionary Framework for different classes of Critical Node Problems. Eng. Appl. Artif. Intell. 55: 128-145 (2016) - [j3]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
A preliminary analysis of the Distance Based Critical Node Problem. Electron. Notes Discret. Math. 55: 25-28 (2016) - [j2]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
Local search metaheuristics for the critical node problem. Networks 67(3): 209-221 (2016) - 2015
- [j1]Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
VNS solutions for the Critical Node Problem. Electron. Notes Discret. Math. 47: 37-44 (2015)
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-07-08 21:30 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:
