A System to Analyse Interviews and Structure the Acquired Knowledge Elements. - Maria Franca Norese; Fabio Salassa (DSS, 2010)

A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. - Federico Della Croce; Andrea Grosso; Fabio Salassa (EvoCOP, 2011)

Matheuristics for Combinatorial Optimization Problems:Applications to Services and Production Systems. - Fabio Salassa (2011)

A System To Integrate Unstructured And Semistructured Information Resources: An Application In An Innovation Design Process. - Maria Franca Norese; Chiara Novello; Fabio Salassa (DSS, 2012)

Matheuristics for combinatorial optimization problems: applications to services and production systems. - Fabio Salassa (4OR, 2012)

Improved LP-based algorithms for the closest string problem. - Federico Della Croce; Fabio Salassa (Comput. Oper. Res., 2012)

A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. - Federico Della Croce; Michele Garraffa; Fabio Salassa (ISCO, 2014)

A matheuristic approach for the two-machine total completion time flow shop problem. - Federico Della Croce; Andrea Grosso; Fabio Salassa (Ann. Oper. Res., 2014)

A variable neighborhood search based matheuristic for nurse rostering problems. - Federico Della Croce; Fabio Salassa (Ann. Oper. Res., 2014)

A hybrid heuristic approach for single machine scheduling with release times. - Federico Della Croce; Fabio Salassa; Vincent T'kindt (Comput. Oper. Res., 2014)

An Integrated System to Acquire Knowledge and Support Decisions in Complex Innovation Design Processes. - Maria Franca Norese; Chiara Novello; Fabio Salassa (J. Organ. Comput. Electron. Commer., 2015)

A hybrid three-phase approach for the Max-Mean Dispersion Problem. - Federico Della Croce; Michele Garraffa; Fabio Salassa (Comput. Oper. Res., 2016)

The one-dimensional cutting stock problem with sequence-dependent cut losses. - Michele Garraffa; Fabio Salassa; Wim Vancroonenburg; Greet Vanden Berghe; Tony Wauters (Int. Trans. Oper. Res., 2016)

Searching for a cycle with maximum coverage in undirected graphs. - Andrea Grosso; Fabio Salassa; Wim Vancroonenburg (Optim. Lett., 2016)

Heuristic approaches for a domestic energy management system. - Federico Della Croce; Michele Garraffa; Fabio Salassa; Claudio Borean; Giuseppe Di Bella; Ennio Grasso (Comput. Ind. Eng., 2017)

An exact approach for the 0-1 knapsack problem with setups. - Federico Della Croce; Fabio Salassa; Rosario Scatamacchia (Comput. Oper. Res., 2017)

No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. - Jean-Charles Billaut; Federico Della Croce; Fabio Salassa; Vincent T'kindt (CoRR, 2017)

MILP and Max-Clique based heuristics for the Eternity II puzzle. - Fabio Salassa; Wim Vancroonenburg; Tony Wauters; Federico Della Croce; Greet Vanden Berghe (CoRR, 2017)

A new exact approach for the 0-1 Collapsing Knapsack Problem. - Federico Della Croce; Fabio Salassa; Rosario Scatamacchia (Eur. J. Oper. Res., 2017)

Local and global constraint consistency in personnel rostering. - Pieter Smet; Fabio Salassa; Greet Vanden Berghe (Int. Trans. Oper. Res., 2017)

An exact semidefinite programming approach for the max-mean dispersion problem. - Michele Garraffa; Federico Della Croce; Fabio Salassa (J. Comb. Optim., 2017)

A Distributed IoT Infrastructure to Test and Deploy Real-Time Demand Response in Smart Grids. - Luca Barbierato; Abouzar Estebsari; Enrico Pons; Marco Pau; Fabio Salassa; Marco Ghirardi; Edoardo Patti (IEEE Internet Things J., 2019)

No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. - Jean-Charles Billaut; Federico Della Croce; Fabio Salassa; Vincent T'kindt (J. Sched., 2019)

Evaluating the Deployment of Collaborative Logistics Models for Local Delivery Services. - Andrea Bari; Fabio Salassa; Maurizio Arnone; Tiziana Delmastro (APMS (4), 2021)

Merging combinatorial design and optimization: the Oberwolfach problem. - Fabio Salassa; Gabriele Dragotto; Tommaso Traetta; Marco Buratti; Federico Della Croce (Australas. J Comb., 2021)

Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs. - Jully Jeunet; Federico Della Croce; Fabio Salassa (Comput. Oper. Res., 2021)

Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. - Federico Della Croce; Andrea Grosso; Fabio Salassa (J. Heuristics, 2021)

Column generation for minimizing total completion time in a parallel-batching environment. - Arianna Alfieri; Alessandro Druetto; Andrea Grosso; Fabio Salassa (J. Sched., 2021)

MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem. - Andrea Balogh; Michele Garraffa; Barry O'Sullivan; Fabio Salassa (Comput. Oper. Res., 2022)

Exact solution of the two-machine flow shop problem with three operations. - Federico Della Croce; Fabio Salassa; Vincent T'kindt (Comput. Oper. Res., 2022)

Single machine rescheduling for new orders with maximum lateness minimization. - Elena Rener; Fabio Salassa; Vincent T'kindt (Comput. Oper. Res., 2022)

Single machine rescheduling for new orders: properties and complexity results. - Elena Rener; Fabio Salassa; Vincent T'kindt (CoRR, 2023)

Permutation flowshop problems minimizing core waiting time and core idle time. - Arianna Alfieri; Michele Garraffa; Erica Pastore; Fabio Salassa (Comput. Ind. Eng., 2023)

The discrete time break scheduling problem under fatigue and no preemption: solution methods and impact of work regulations. - Jully Jeunet; Fabio Salassa (Int. J. Prod. Res., 2023)

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server. - Alessandro Druetto; Andrea Grosso; Jully Jeunet; Fabio Salassa (Comput. Oper. Res., 2025)

A note on "Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers". - Andrea Grosso; Fabio Salassa (Comput. Oper. Res., 2025)