Sfoglia per Autore
The daily swab test collection problem
2024-01-01 Aringhieri R.; Bigharaz S.; Druetto A.; Duma D.; Grosso A.; Guastalla A.
Constructive and Destructive Methods in Heuristic Search
2023-01-01 Aringhieri, Roberto; Cordone, Roberto; Guastalla, Alberto; Grosso, Andrea
Job Shop Scheduling via Deep Reinforcement Learning: A Sequence to Sequence Approach
2023-01-01 Bonetta G.; Zago D.; Cancelliere R.; Grosso A.
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱
2023-01-01 Druetto, Alessandro; Bini, Enrico; Grosso, Andrea; Puri, Stefano; Bacci, Silvio; Di Natale, Marco; Paladino, Francesco
Polynomial-Size Models to Minimize Total Completion Time in a Parallel Batching Environment
2022-01-01 Druetto, Alessandro; Grosso, Andrea
Polynomial-Size ILP formulations for the Total Completion Time Problem on a Parallel Batching Machine
2022-01-01 Alessandro Druetto; Andrea Grosso
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
2022-01-01 Druetto A.; Grosso A.
The Connected Critical Node Problem
2022-01-01 Hosteins P.; Scatamacchia R.; Grosso A.; Aringhieri R.
Column generation bounds on a network flow model to minimize the total weighted completion time for a single parallel batching machine
2021-01-01 Alessandro Druetto, Andrea Cesare Grosso
Column generation for minimizing total completion time in a parallel-batching environment
2021-01-01 Alfieri A.; Druetto A.; Grosso A.; Salassa F.
Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem
2019-01-01 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre*; Scatamacchia, Rosario
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
2019-01-01 Della Croce F.; Grosso A.; Salassa F.
Column generation for minimizing total completion time on a single machine with parallel batching
2019-01-01 Alfieri A.; Druetto A.; Grosso A.; Salassa F.
Simple but effective heuristics for the 2-Constraint Bin Packing Problem
2018-01-01 Aringhieri, Roberto; Duma, Davide; Grosso, Andrea; Hosteins, Pierre
Searching for a cycle with maximum coverage in undirected graphs
2016-01-01 Grosso, Andrea; Salassa, Fabio; Vancroonenburg, Wim
Operating room scheduling and rescheduling: a rolling horizon approach.
2016-01-01 Addis, Bernardetta; Carello, Giuliana; Grosso, Andrea; Tànfani, Elena
Local search and pseudoinversion: an hybrid approach to neural network training
2016-01-01 Rubini, Luca; Cancelliere, Rossella; Gallinari, Patrick; Grosso, Andrea Cesare
A General Evolutionary Framework for different classes of Critical Node Problems
2016-01-01 Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario
Hybrid constructive heuristics for the critical node problem
2016-01-01 Addis, Bernardetta; Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre
Local Search Metaheuristics for the Critical Node Problem
2016-01-01 R. Aringhieri; A. Grosso; P. Hosteins; R. Scatamacchia
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile