default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabio Salassa
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j26]Alessandro Druetto, Andrea Grosso, Jully Jeunet, Fabio Salassa:
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server. Comput. Oper. Res. 174: 106911 (2025)- 2023
- [j25]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) - [j24]Jully Jeunet, Fabio Salassa:
The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations. Int. J. Prod. Res. 61(16): 5372-5391 (2023) - [i3]Elena Rener, Fabio Salassa, Vincent T'kindt:
Single machine rescheduling for new orders: properties and complexity results. CoRR abs/2307.14876 (2023) - 2022
- [j23]Federico Della Croce, Fabio Salassa, Vincent T'kindt:
Exact solution of the two-machine flow shop problem with three operations. Comput. Oper. Res. 138: 105595 (2022) - [j22]Elena Rener, Fabio Salassa, Vincent T'kindt:
Single machine rescheduling for new orders with maximum lateness minimization. Comput. Oper. Res. 144: 105815 (2022) - [j21]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) - 2021
- [j20]Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce:
Merging combinatorial design and optimization: the Oberwolfach problem. Australas. J Comb. 79: 141-166 (2021) - [j19]Jully Jeunet, Federico Della Croce, Fabio Salassa:
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs. Comput. Oper. Res. 127: 105151 (2021) - [j18]Federico Della Croce, Andrea Grosso, Fabio Salassa:
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics 27(1-2): 159-173 (2021) - [j17]Arianna Alfieri, Alessandro Druetto, Andrea Grosso, Fabio Salassa:
Column generation for minimizing total completion time in a parallel-batching environment. J. Sched. 24(6): 569-588 (2021) - [c5]Andrea Bari, Fabio Salassa, Maurizio Arnone, Tiziana Delmastro:
Evaluating the Deployment of Collaborative Logistics Models for Local Delivery Services. APMS (4) 2021: 613-621
2010 – 2019
- 2019
- [j16]Luca Barbierato, Abouzar Estebsari, Enrico Pons, Marco Pau, Fabio Salassa, Marco Ghirardi, Edoardo Patti:
A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids. IEEE Internet Things J. 6(1): 1136-1146 (2019) - [j15]Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. J. Sched. 22(1): 59-68 (2019) - 2017
- [j14]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) - [j13]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) - [j12]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) - [j11]Pieter Smet, Fabio Salassa, Greet Vanden Berghe:
Local and global constraint consistency in personnel rostering. Int. Trans. Oper. Res. 24(5): 1099-1117 (2017) - [j10]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) - [i2]Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt:
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. CoRR abs/1707.02849 (2017) - [i1]Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe:
MILP and Max-Clique based heuristics for the Eternity II puzzle. CoRR abs/1709.00252 (2017) - 2016
- [j9]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) - [j8]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) - [j7]Andrea Grosso, Fabio Salassa, Wim Vancroonenburg:
Searching for a cycle with maximum coverage in undirected graphs. Optim. Lett. 10(7): 1493-1504 (2016) - 2015
- [j6]Maria Franca Norese, Chiara Novello, Fabio Salassa:
An Integrated System to Acquire Knowledge and Support Decisions in Complex Innovation Design Processes. J. Organ. Comput. Electron. Commer. 25(2): 194-212 (2015) - 2014
- [j5]Federico Della Croce, Andrea Grosso, Fabio Salassa:
A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213(1): 67-78 (2014) - [j4]Federico Della Croce, Fabio Salassa:
A variable neighborhood search based matheuristic for nurse rostering problems. Ann. Oper. Res. 218(1): 185-199 (2014) - [j3]Federico Della Croce, Fabio Salassa, Vincent T'kindt:
A hybrid heuristic approach for single machine scheduling with release times. Comput. Oper. Res. 45: 7-11 (2014) - [c4]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 - 2012
- [j2]Fabio Salassa:
Matheuristics for combinatorial optimization problems: applications to services and production systems. 4OR 10(2): 213-214 (2012) - [j1]Federico Della Croce, Fabio Salassa:
Improved LP-based algorithms for the closest string problem. Comput. Oper. Res. 39(3): 746-749 (2012) - [c3]Maria Franca Norese, Chiara Novello, Fabio Salassa:
A System To Integrate Unstructured And Semistructured Information Resources: An Application In An Innovation Design Process. DSS 2012: 446-457 - 2011
- [b1]Fabio Salassa:
Matheuristics for Combinatorial Optimization Problems:Applications to Services and Production Systems. Polytechnic University of Turin, Italy, 2011 - [c2]Federico Della Croce, Andrea Grosso, Fabio Salassa:
A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. EvoCOP 2011: 38-47 - 2010
- [c1]Maria Franca Norese, Fabio Salassa:
A System to Analyse Interviews and Structure the Acquired Knowledge Elements. DSS 2010: 461-472
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-12-05 20:47 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:
