Tour
News
People
Research
Projects
Events
Publications
Contact
Experimental Analysis
A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm For Course Timetabling Problems
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Ruggero Bellio
,
Luca Di Gaspero
,
Andrea Schaerf
Cite
Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Fabio De Cesco
,
Luca Di Gaspero
,
Andrea Schaerf
Cite
EasyAnalyzer: an object-oriented framework for the experimental analysis of stochastic local search algorithms
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Luca Di Gaspero
,
Andrea Roli
,
Andrea Schaerf
Cite
Measurability and reproducibility in university timetabling research: Discussion and proposals
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Andrea Schaerf
,
Luca Di Gaspero
PDF
Cite
textscEasyAnalyzer: an object-oriented framework for the analysis of stochastic local search algorithms
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Luca Di Gaspero
,
Andrea Roli
,
Andrea Schaerf
PDF
Cite
DOI
A study on the short-term prohibition mechanisms in tabu search
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Luca Di Gaspero
,
Marco Chiarandini
,
Andrea Schaerf
Cite
A Study on the Short-Term Prohibition Mechanisms in Tabu Search for Examination Timetabling
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Luca Di Gaspero
,
Andrea Schaerf
,
Marco Chiarandini
Cite
A study on the short-term prohibition mechanisms in tabu search
Add the
full text
or
supplementary notes
for the publication here using Markdown formatting.
Luca Di Gaspero
,
Marco Chiarandini
,
Andrea Schaerf
Cite
A Tabu Search Approach to the Traveling Tournament Problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features both from the traveling salesman problem and …
Luca Di Gaspero
,
Andrea Schaerf
PDF
Cite
«
Cite
×