Sfoglia per Relatore
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
2021/2022 PARO, DAVIDE
Analysis of implementation techniques for an A* search based on the LM-Cut heuristic
2024/2025 MODOLO, RICCARDO
Applicability of Discrete Black-Box Optimization techniques to optimize a generic production process simulator
2020/2021 PERALI, LUCA
Approcci a problemi di AI Planning tramite programmazione lineare intera
2021/2022 GIROTTO, PIETRO
Approcci MIP per il Maximum Weighted Submatrix Coverage Problem
2024/2025 TREVISAN, MATTEO
Design and Evaluation of a Novel Heuristic for Delete-Free AI Planning
2024/2025 STOCCO, ANDREA
Enhancing the ACS Heuristic: Parameter Tuning and Computational Experiments for Solving MIP Problems
2024/2025 BISCACCIA CARRARA, FRANCESCO
Esperimenti computazionali su approcci MIP per problemi di facility location
2024/2025 ZANIN, ANDREA
Esperimenti di programmazione lineare intera per il timetabling accademico
2024/2025 CALZAVARA, MATTIA
Esperimenti MIP per una classe di problemi di assegnamento quadratico
2022/2023 TOFFOLON, MATTIA
Esperimenti su reduced cost fixing in Programmazione Lineare Intera
2023/2024 BENETTI, CHRISTIAN
Esplorazione delle soluzioni al problema del commesso viaggiatore: dagli algoritmi esatti al Red-Black Ant Colony System
2023/2024 SABIR, MOUHIEDDINE
Eurisitci per la competizione Google HashCode 2020
2020/2021 GULMINI, RICCARDO
Experimental evaluation of subgradient method for linear programming
2020/2021 DOLCI, LUCA
Formulazioni MIP per la competizione Google Hashcode 2020
2020/2021 DOVIGO, AMIN
Frank Wolfe Method for Set Cover Problem with Lagrangian Relaxation
2023/2024 BRAL, ASHWINI
Implementazione dell'euristico Alternating Criteria Search per problemi di programmazione lineare intera
2023/2024 PIAI, LUCA
Implementazione di un euristico basato su sub-MIP per la programmazione lineare intera
2023/2024 FARRUKU, JURI
MIP formulations for Delete-free AI Planning
2024/2025 ZANELLA, MATTEO
Modelli MIP per problemi basati sul numero di Alcuin di un grafo
2022/2023 SPROCATTI, MICHELE
| Tipologia | Anno | Titolo | Titolo inglese | Autore | File |
|---|---|---|---|---|---|
| Lauree magistrali | 2021 | A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem | A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem | PARO, DAVIDE | |
| Lauree magistrali | 2024 | Analysis of implementation techniques for an A* search based on the LM-Cut heuristic | Analysis of implementation techniques for an A* search based on the LM-Cut heuristic | MODOLO, RICCARDO | |
| Lauree magistrali | 2020 | Applicability of Discrete Black-Box Optimization techniques to optimize a generic production process simulator | Applicability of Discrete Black-Box Optimization techniques to optimize a generic production process simulator | PERALI, LUCA | |
| Lauree triennali | 2021 | Approcci a problemi di AI Planning tramite programmazione lineare intera | Integer Linear Programming approaches to AI Planning problems | GIROTTO, PIETRO | |
| Lauree triennali | 2024 | Approcci MIP per il Maximum Weighted Submatrix Coverage Problem | MIP Approaches for the Maximum Weighted Submatrix Coverage Problem | TREVISAN, MATTEO | |
| Lauree magistrali | 2024 | Design and Evaluation of a Novel Heuristic for Delete-Free AI Planning | Design and Evaluation of a Novel Heuristic for Delete-Free AI Planning | STOCCO, ANDREA | |
| Lauree magistrali | 2024 | Enhancing the ACS Heuristic: Parameter Tuning and Computational Experiments for Solving MIP Problems | Enhancing the ACS Heuristic: Parameter Tuning and Computational Experiments for Solving MIP Problems | BISCACCIA CARRARA, FRANCESCO | |
| Lauree triennali | 2024 | Esperimenti computazionali su approcci MIP per problemi di facility location | Computational experiments on MIP approaches for facility location problems | ZANIN, ANDREA | |
| Lauree triennali | 2024 | Esperimenti di programmazione lineare intera per il timetabling accademico | Integer Linear Programming Experiments for Academic Timetabling | CALZAVARA, MATTIA | |
| Lauree triennali | 2022 | Esperimenti MIP per una classe di problemi di assegnamento quadratico | MIP experiments for a class of quadratic assignment problems | TOFFOLON, MATTIA | |
| Lauree triennali | 2023 | Esperimenti su reduced cost fixing in Programmazione Lineare Intera | Experiments on reduced cost fixing in Mixed Integer Programming | BENETTI, CHRISTIAN | |
| Lauree triennali | 2023 | Esplorazione delle soluzioni al problema del commesso viaggiatore: dagli algoritmi esatti al Red-Black Ant Colony System | Exploring Solutions to the Travelling Salesman Problem From Exact Algorithms to the Red-Black Ant Colony System | SABIR, MOUHIEDDINE | |
| Lauree triennali | 2020 | Eurisitci per la competizione Google HashCode 2020 | Heuristics for the Google HashCode 2020 Competition | GULMINI, RICCARDO | |
| Lauree magistrali | 2020 | Experimental evaluation of subgradient method for linear programming | Experimental evaluation of subgradient method for linear programming | DOLCI, LUCA | |
| Lauree triennali | 2020 | Formulazioni MIP per la competizione Google Hashcode 2020 | MIP formulations for the Google Hashcode 2020 Competition | DOVIGO, AMIN | |
| Lauree magistrali | 2023 | Frank Wolfe Method for Set Cover Problem with Lagrangian Relaxation | Frank Wolfe Method for Set Cover Problem with Lagrangian Relaxation | BRAL, ASHWINI | |
| Lauree triennali | 2023 | Implementazione dell'euristico Alternating Criteria Search per problemi di programmazione lineare intera | Implementation of the Alternating Criteria Search heuristic for integer linear programming problems | PIAI, LUCA | |
| Lauree triennali | 2023 | Implementazione di un euristico basato su sub-MIP per la programmazione lineare intera | Implementation of a sub-MIP based primal heuristic for integer linear programming | FARRUKU, JURI | |
| Lauree magistrali | 2024 | MIP formulations for Delete-free AI Planning | MIP formulations for Delete-free AI Planning | ZANELLA, MATTEO | |
| Lauree triennali | 2022 | Modelli MIP per problemi basati sul numero di Alcuin di un grafo | MIP models for problems based on the Alcuin Number of a graph | SPROCATTI, MICHELE |
Legenda icone
- file ad accesso aperto
- file ad accesso riservato
- file sotto embargo
- nessun file disponibile