Luca Di Gaspero

Latest

• A Multi-objective BRKGA for the Siting of Emergency Vehicles
• Analisi di dati e algoritmi di ottimizzazione per la locazione delle stazioni delle ambulanze: un caso studio
• Multi-Neighborhood Simulated Annealing for the Minimum Interference Frequency Assignment Problem
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
• An extended regularized adjusted plus-minus analysis for lineup management in basketball using play-by-play data
• Extending and Solving the Refrigerated Routing Problem
• Local Search and Constraint Programming for a Real-World Examination Timetabling Problem
• Modeling and solving the steelmaking and casting scheduling problem
• Modeling and Solving the Thesis Defense Timetabling Problem
• The practice and theory of automated timetabling (2016)
• 12th International Conference on the Practice and Theory of Automated Timetabling
• A Metaheuristic Approach for Scheduling Steelmaking and Casting Plants
• Modeling and Solving the Steelmaking and Casting Planning and Scheduling Problem
• Solving Discrete Lot-Sizing and Scheduling by Simulated Annealing and Mixed Integer Programming
• 11th International Conference on the Practice and Theory of Automated Timetabling
• Balancing Bike Sharing Systems with Constraint Programming
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
• Simulated Annealing for Discrete Lot-Sizing and Scheduling
• The Third International Timetabling Competition
• Practical Solution of Rich Routing Problems with CP and Metaheuristics
• A General Local Search Solver for FlatZinc
• An Investigation on Swarm Intelligence Methods for the Optimization of Complex Part Programs in CNC Turning
• Integration of Metaheuristics and Constraint Programming
• A CP/LNS Approach for Multi-day Homecare Scheduling Problems
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
• The generalized balanced academic curriculum problem with heterogeneous classes
• A simulated annealing approach to the curriculum-based course timetabling problem
• A Hybrid ACO+CP for Balancing Bicycle Sharing Systems
• A Multi-paradigm Tool for Large Neighborhood Search
• Advances in Metaheuristics
• Automated Shift Design and Break Scheduling
• Constraint-Based Approaches for Balancing Bike Sharing Systems
• Investigations on Local Search Based Hybrid Metaheuristics (Studien über hybride Metaheuristiken basierend auf Lokaler Suche)
• Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results
• Design and Statistical Analysis of a Hybrid Local Search Algorithm for Course Timetabling
• Evaluation of a family of reinforcement learning cross-domain optimization heuristics
• The Balanced Academic Curriculum Problem Revisited
• A Reinforcement Learning approach for the Cross-Domain Heuristic Search Challenge
• Proceedings of the 9th Metaheuristics International Conference (MIC 2011)
• Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem
• Hybrid Metaheuristics for Constrained Portfolio Selection Problem
• Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings
• Tabu Search Techniques for the Heterogeneous Vehicle Routing Problem with Time Windows and Carrier-Dependent Costs
• A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
• A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
• Programmazione Web Lato Server: Principi, Tecniche di base, Esercitazioni
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• The Context-Aware Browser
• A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal++
• Context Aware Browser
• EasyGenetic: A Template Metaprogramming Framework for Genetic Master-Slave Algorithms
• Flexible stochastic local search for Haplotype Inference
• Hybrid Metaheuristics 6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings
• Towards a highly scalable hybrid metaheuristic for haplotype inference under parsimony
• AI on the Move: Exploiting AI Techniques for Context Inference on Mobile Devices
• A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm For Course Timetabling Problems
• A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm For Course Timetabling Problems
• AI Techniques in a context-aware ubiquitous environment
• Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results
• Context-Aware Browser
• EasyAnalyzer: an object-oriented frameowrk for the experimental analysis of stochastic local search algorithms
• Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
• Stochastic local search for large-scale instances of the Haplotype Inference Problem by Parsimony
• Swarming in a virtual world: a PSO approach to virtual camera composition
• Two-level ACO for Haplotype Inference under pure parsimony
• Virtual Camera Composition with Particle Swarm Optimization
• The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3)
• The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3)
• Metaheuristics for the Haplotype Inference Problem: a preliminary analysis
• The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling Track
• Hybrid metaheuristics for portfolio selection problems
• A Composite-Neighborhood Tabu Search Approach to the Traveling Tournament Problem
• Solving Portfolio selection problems through hybrid techniques
• A Hybrid Solver for Constrained Portfolio Selection Problems: preliminary report
• A preliminary analysis on metaheuristics methods applied to the Haplotype Inference Problem
• Automatic timetabling in healthcare organisations
• Hybrid Local Search for Constrained Financial Portfolio Selection Problems
• Measurability and Reproducibility in Timetabling Research: Discussion and Proposals
• Programmazione Web Lato Server: Principi, Tecniche di base, Esercitazioni
• textscEasyAnalyzer: an object-oriented framework for the analysis of stochastic local search algorithms
• textscEasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
• The minimum shift design problem
• A study on the short-term prohibition mechanisms in tabu search
• A Study on the Short-Term Prohibition Mechanisms in Tabu Search for Examination Timetabling
• Measurability and Reproducibility in Timetabling Research: State-of-the-Art and Discussion
• Tabu Search Techniques for the Traveling Tournament Problem
• A study on the short-term prohibition mechanisms in tabu search
• Approcci ibridi al problema del Rostering: un caso di studio nell'integrazione di programmazione con vincoli e ricerca locale
• Experiments on Average Distance Measure
• Hybrid Approaches for Rostering: a Case Study in the Integration of Constraint Programming and Local Search
• Measuring Retrieval Effectiveness with Average Distance Measure (ADM)
• Neighborhood Portfolio Approach for Local Search applied to Timetabling Problems
• A Tabu Search Approach to the Traveling Tournament Problem
• A MultiAgent Architecture for Distributed Course Timetabling
• Information Filtering and Retrieving of Context-Aware Applications Within the MoBe Framework
• A Tabu Search Approach to the Traveling Tournament Problem
• MoBe: A Framework for Context-Aware Mobile Applications
• Context-Aware Mobile Applications on Mobile Devices for Mobile Users
• Theory and practice of the minimum shift design problem
• A MultiAgent Architecture for Distributed Course Timetabling
• Evaluating ADM on a four-level relevance scale document set from NTCIR
• A MultiAgent Architecture for Distributed Course Timetabling
• A Multineighbourhood Local Search Solver for the Timetabling Competition TTComp-2002
• Il problema della generazione automatica dell'orario delle lezioni: teoria e pratica
• A hybrid network flow tabu search heuristic for the minimum shift design problem
• textscEasyLocal++: An object-oriented framework for flexible design of local search algorithms
• CD Didattico per il corso di Fondamenti di Informatica
• Local Search Techniques for Scheduling Problems: Algorithms and Software Tools
• Multi-Neighbourhood Local Search with Application to Course Timetabling
• The Concept of Relevance in Mobile and Ubiquitous Information Access
• The minimum shift design problem: theory and practice
• A review of neighborhood structures for the job-shop scheduling problem
• From E-Relevance to W-Relevance
• Multi-Neighbourhood Local Search for Course Timetabling
• Recolour, Shake and Kick: a recipe for the Examination Timetabling Problem
• Writing Local Search Algorithms using textscEasyLocal++
• textscEasyLocal++: an object-oriented framework for the flexible design of local search algorithms and metaheuristics.
• A case-study for textscEasyLocal++: the Course Timetabling Problem
• CD Didattico per il corso di Fondamenti di Informatica
• Local Search Techniques for Educational Timetabling Problems
• Tabu Search Techniques for Examination Timetabling
• Tabu Search Techniques for Examination Timetabling
• Seamless Access to Databases through KQML in an Agent-enriched Web
• textscEasyLocal++: An object-oriented framework for flexible design of local search algorithms
• MANTHA: Agent-based Management of Hypermedia Documents
• Internet Agents for telemedicine services
• Sistemi multiagente: tecniche di condivisione della conoscenza
• Internet Agents for telemedicine services
• An agent-based approach to the delivery of telepathology services.
• Appunti dal corso di Sistemi di Elaborazione dell'Informazione