The following pages link to Fabio Salassa (Q331986):
Displaying 21 items.
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
- A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
- Matheuristics for combinatorial optimization problems: applications to services and production systems. (Summary) (Q1936662) (← links)
- Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs (Q2027018) (← links)
- A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
- Single machine rescheduling for new orders with maximum lateness minimization (Q2147102) (← links)
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- Exact solution of the two-machine flow shop problem with three operations (Q2669696) (← links)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
- The one-dimensional cutting stock problem with sequence-dependent cut losses (Q2803252) (← links)
- A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (Q3195327) (← links)
- Merging Combinatorial Design and Optimization: the Oberwolfach Problem (Q4990113) (← links)
- Local and global constraint consistency in personnel rostering (Q5364073) (← links)
- Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server (Q6521671) (← links)
