Fabio Salassa

From MaRDI portal
Person:331986

Available identifiers

zbMath Open salassa.fabioMaRDI QIDQ331986

List of research outcomes





PublicationDate of PublicationType
MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem2022-09-27Paper
Single machine rescheduling for new orders with maximum lateness minimization2022-06-22Paper
A simple and effective algorithm for the maximum happy vertices problem2022-04-04Paper
Exact solution of the two-machine flow shop problem with three operations2022-03-09Paper
Merging Combinatorial Design and Optimization: the Oberwolfach Problem2021-05-28Paper
Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs2021-05-21Paper
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths2019-10-08Paper
A solution to a Partitioned Balanced Tournament Design of side 112019-03-14Paper
An exact approach for the 0-1 knapsack problem with setups2018-07-11Paper
A new exact approach for the 0-1 collapsing knapsack problem2018-05-29Paper
An exact semidefinite programming approach for the max-mean dispersion problem2017-10-17Paper
Local and global constraint consistency in personnel rostering2017-10-02Paper
A hybrid three-phase approach for the Max-Mean dispersion problem2016-11-17Paper
A hybrid heuristic approach for single machine scheduling with release times2016-11-10Paper
Searching for a cycle with maximum coverage in undirected graphs2016-10-27Paper
The one-dimensional cutting stock problem with sequence-dependent cut losses2016-05-04Paper
A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem2015-10-16Paper
A variable neighborhood search based matheuristic for nurse rostering problems2014-11-26Paper
A matheuristic approach for the two-machine total completion time flow shop problem2014-09-26Paper
Matheuristics for combinatorial optimization problems: applications to services and production systems. (Summary)2013-02-06Paper
Improved LP-based algorithms for the closest string problem2012-11-15Paper
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common serverN/APaper

Research outcomes over time

This page was built for person: Fabio Salassa