default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Garraffa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Arianna Alfieri, Michele Garraffa, Erica Pastore
, Fabio Salassa:
Permutation flowshop problems minimizing core waiting time and core idle time. Comput. Ind. Eng. 176: 108983 (2023)- 2022
- [j9]Federico Toffano, Michele Garraffa, Yiqing Lin, Steven D. Prestwich, Helmut Simonis, Nic Wilson:
A multi-objective supplier selection framework based on user-preferences. Ann. Oper. Res. 308(1): 609-640 (2022) - [j8]Andrea Balogh, Michele Garraffa, Barry O'Sullivan, Fabio Salassa:
MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem. Comput. Oper. Res. 146: 105862 (2022) - [c7]Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis:
A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times. CPAIOR 2022: 1-13 - 2021
- [j7]Michele Garraffa, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
An adaptive large neighbourhood search algorithm for diameter bounded network design problems. J. Heuristics 27(5): 887-922 (2021) - [c6]Eddie Armstrong, Michele Garraffa, Barry O'Sullivan, Helmut Simonis:
The Hybrid Flexible Flowshop with Transportation Times. CP 2021: 16:1-16:18 - 2020
- [i1]Francesco Grassi, Giorgio Manganini, Michele Garraffa, Laura Mainini:
Resource Aware Multifidelity Active Learning for Efficient Optimization. CoRR abs/2007.04674 (2020)
2010 – 2019
- 2019
- [c5]Gabriel G. Castañé, Helmut Simonis, Kenneth N. Brown, Yiqing Lin, Cemalettin Ozturk, Michele Garraffa, Mark Antunes:
Simulation-Based Optimization Tool for Field Service Planning. WSC 2019: 1684-1695 - 2018
- [j6]Michele Garraffa, Lei Shang, Federico Della Croce, Vincent T'kindt:
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. Theor. Comput. Sci. 745: 133-149 (2018) - [c4]Michele Garraffa, Mustapha Bekhti, Lucas Létocart, Nadjib Achir, Khaled Boussetta:
Drones path planning for WSN data gathering: A column generation heuristic approach. WCNC 2018: 1-6 - 2017
- [j5]Federico Della Croce, Michele Garraffa, Fabio Salassa, Claudio Borean, Giuseppe Di Bella, Ennio Grasso:
Heuristic approaches for a domestic energy management system. Comput. Ind. Eng. 109: 169-178 (2017) - [j4]Michele Garraffa, Federico Della Croce, Fabio Salassa:
An exact semidefinite programming approach for the max-mean dispersion problem. J. Comb. Optim. 34(1): 71-93 (2017) - [c3]Mustapha Bekhti, Michele Garraffa, Nadjib Achir, Khaled Boussetta, Lucas Létocart:
Assessment of multi-UAVs tracking for data gathering. IWCMC 2017: 1004-1009 - [c2]Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt:
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. IPEC 2017: 28:1-28:12 - 2016
- [j3]Federico Della Croce, Michele Garraffa, Fabio Salassa:
A hybrid three-phase approach for the Max-Mean Dispersion Problem. Comput. Oper. Res. 71: 16-22 (2016) - [j2]Michele Garraffa, Fabio Salassa, Wim Vancroonenburg, Greet Vanden Berghe, Tony Wauters:
The one-dimensional cutting stock problem with sequence-dependent cut losses. Int. Trans. Oper. Res. 23(1-2): 5-24 (2016) - 2014
- [j1]Federico Della Croce, Michele Garraffa:
The Selective Fixing Algorithm for the closest string problem. Comput. Oper. Res. 41: 24-30 (2014) - [c1]Federico Della Croce, Michele Garraffa, Fabio Salassa:
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. ISCO 2014: 186-197
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 2025-01-09 12:57 CET 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:
