Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Luca Di Gaspero
2010 – today
- 2013
[c26]Luca Di Gaspero, Andrea Rendl, Tommaso Urli: A Hybrid ACO+CP for Balancing Bicycle Sharing Systems. Hybrid Metaheuristics 2013: 198-212- 2012
[j13]Alex Bonutti, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf: Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. Annals OR 194(1): 59-70 (2012)
[j12]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf: Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & OR 39(7): 1615-1624 (2012)
[j11]Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, Andrea Schaerf: The balanced academic curriculum problem revisited. J. Heuristics 18(1): 119-148 (2012)
[j10]Ruggero Bellio, Luca Di Gaspero, Andrea Schaerf: Design and statistical analysis of a hybrid local search algorithm for course timetabling. J. Scheduling 15(1): 49-61 (2012)
[c25]Luca Di Gaspero, Tommaso Urli: Evaluation of a Family of Reinforcement Learning Cross-Domain Optimization Heuristics. LION 2012: 384-389- 2011
[j9]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf: Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Scheduling 14(6): 601-615 (2011)
[c24]Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf: Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings. LION 2011: 450-453
[i2]- 2010
[j8]Paolo Coppola, Vincenzo Della Mea, Luca Di Gaspero, Davide Menegon, Danny Mischis, Stefano Mizzaro, Ivan Scagnetto, Luca Vassena: The Context-Aware Browser. IEEE Intelligent Systems 25(1): 38-47 (2010)
[j7]Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS Journal on Computing 22(1): 120-130 (2010)
[c23]Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany: A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem. Hybrid Metaheuristics 2010: 46-61
2000 – 2009
- 2009
[c22]Raffaele Cipriano, Luca Di Gaspero, Agostino Dovier: A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + + . Hybrid Metaheuristics 2009: 141-155
[c21]Luca Di Gaspero, Andrea Roli: Flexible Stochastic Local Search for Haplotype Inference. LION 2009: 74-88
[c20]Stefano Benedettini, Andrea Roli, Luca Di Gaspero: EasyGenetic: A Template Metaprogramming Framework for Genetic Master-Slave Algorithms. SLS 2009: 135-139
[e1]Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf (Eds.): Hybrid Metaheuristics, 6th International Workshop, HM 2009, Udine, Italy, October 16-17, 2009. Proceedings. Lecture Notes in Computer Science 5818, Springer 2009, ISBN 978-3-642-04917-0- 2008
[j6]Luca Di Gaspero, Andrea Roli: Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony. J. Algorithms 63(1-3): 55-69 (2008)
[c19]Luca Di Gaspero, Andrea Ermetici, Roberto Ranon: Swarming in a Virtual World: A PSO Approach to Virtual Camera Composition. ANTS Conference 2008: 155-166
[c18]Stefano Benedettini, Andrea Roli, Luca Di Gaspero: Two-Level ACO for Haplotype Inference Under Pure Parsimony. ANTS Conference 2008: 179-190
[c17]Adolfo Bulfoni, Paolo Coppola, Vincenzo Della Mea, Luca Di Gaspero, Danny Mischis, Stefano Mizzaro, Ivan Scagnetto, Luca Vassena: AI on the Move: Exploiting AI Techniques for Context Inference on Mobile Devices. ECAI 2008: 668-672
[c16]Stefano Benedettini, Luca Di Gaspero, Andrea Roli: Towards a Highly Scalable Hybrid Metaheuristic for Haplotype Inference Under Parsimony. HIS 2008: 702-707
[c15]Luca Di Gaspero, Andrea Schaerf: Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem. Hybrid Metaheuristics 2008: 146-157
[c14]Paolo Burelli, Luca Di Gaspero, Andrea Ermetici, Roberto Ranon: Virtual Camera Composition with Particle Swarm Optimization. Smart Graphics 2008: 130-141- 2007
[j5]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany: The minimum shift design problem. Annals OR 155(1): 79-105 (2007)
[j4]Luca Di Gaspero, Andrea Schaerf: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13(2): 189-207 (2007)
[c13]Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf: Hybrid Local Search for Constrained Financial Portfolio Selection Problems. CPAIOR 2007: 44-58
[c12]Luca Di Gaspero, Andrea Roli, Andrea Schaerf: EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. SLS 2007: 76-90
[c11]Luca Di Gaspero, Andrea Schaerf: EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. SLS 2007: 177-181
[i1]Luca Di Gaspero, Andrea Roli: A preliminary analysis on metaheuristics methods applied to the Haplotype Inference Problem. CoRR abs/0708.0505 (2007)- 2006
[j3]Luca Di Gaspero, Andrea Schaerf: Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems. J. Math. Model. Algorithms 5(1): 65-89 (2006)
[c10]Luca Di Gaspero, Marco Chiarandini, Andrea Schaerf: A Study on the Short-Term Prohibition Mechanisms in Tabu Search. ECAI 2006: 83-87
[c9]Vincenzo Della Mea, Gianluca Demartini, Luca Di Gaspero, Stefano Mizzaro: Experiments on Average Distance Measure. ECIR 2006: 492-495
[c8]Raffaele Cipriano, Luca Di Gaspero, Agostino Dovier: Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search. Hybrid Metaheuristics 2006: 110-123
[c7]Andrea Schaerf, Luca Di Gaspero: Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals. PATAT 2006: 40-49- 2004
[j2]Luca Di Gaspero, Andrea Schaerf: The course timetabling problem: theory and practice. Intelligenza Artificiale 1(3): 47-54 (2004)- 2003
[j1]Luca Di Gaspero, Andrea Schaerf: EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms. Softw., Pract. Exper. 33(8): 733-765 (2003)
[c6]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany: The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604
[c5]Paolo Coppola, Vincenzo Della Mea, Luca Di Gaspero, Stefano Mizzaro: The Concept of Relevance in Mobile and Ubiquitous Information Access. Mobile HCI Workshop on Mobile and Ubiquitous Information Access 2003: 1-10- 2002
[c4]Luca Di Gaspero, Andrea Schaerf: Multi-neighbourhood Local Search with Application to Course Timetabling. PATAT 2002: 262-275- 2000
[c3]Luca Di Gaspero, Andrea Schaerf: Tabu Search Techniques for Examination Timetabling. PATAT 2000: 104-117
[c2]Lara Cogoi, Vincenzo Della Mea, Luca Di Gaspero, Vito Roberto: Seamless Access to Databases in an Agent-enriched Web. WOA 2000: 109-113
1990 – 1999
- 1999
[c1]Vito Roberto, Vincenzo Della Mea, Luca Di Gaspero, Antonello Conti: MANTHA: Agent-Based Management of Hypermedia Documents. ICMCS, Vol. 2 1999: 814-818
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-02 22:02 CEST by the dblp team



