Fabio Salassa

Available identifiers

zbMath Open salassa.fabioMaRDI QIDQ331986

List of research outcomes

Publication	Date of Publication	Type
MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem	2022-09-27	Paper
Single machine rescheduling for new orders with maximum lateness minimization	2022-06-22	Paper
A simple and effective algorithm for the maximum happy vertices problem	2022-04-04	Paper
Exact solution of the two-machine flow shop problem with three operations	2022-03-09	Paper
Merging Combinatorial Design and Optimization: the Oberwolfach Problem	2021-05-28	Paper
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs	2021-05-21	Paper
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths	2019-10-08	Paper
A solution to a Partitioned Balanced Tournament Design of side 11	2019-03-14	Paper
An exact approach for the 0-1 knapsack problem with setups	2018-07-11	Paper
A new exact approach for the 0-1 collapsing knapsack problem	2018-05-29	Paper
An exact semidefinite programming approach for the max-mean dispersion problem	2017-10-17	Paper
Local and global constraint consistency in personnel rostering	2017-10-02	Paper
A hybrid three-phase approach for the Max-Mean dispersion problem	2016-11-17	Paper
A hybrid heuristic approach for single machine scheduling with release times	2016-11-10	Paper
Searching for a cycle with maximum coverage in undirected graphs	2016-10-27	Paper
The one-dimensional cutting stock problem with sequence-dependent cut losses	2016-05-04	Paper
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem	2015-10-16	Paper
A variable neighborhood search based matheuristic for nurse rostering problems	2014-11-26	Paper
A matheuristic approach for the two-machine total completion time flow shop problem	2014-09-26	Paper
Matheuristics for combinatorial optimization problems: applications to services and production systems. (Summary)	2013-02-06	Paper
Improved LP-based algorithms for the closest string problem	2012-11-15	Paper
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server	N/A	Paper

Research outcomes over time

This page was built for person: Fabio Salassa