Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Luca Di Gaspero"'
Publikováno v:
Journal of the Operational Research Society. 70:1039-1050
The thesis defense timetabling problem consists in composing the suitable committee for a set of defense sessions and assigning each graduation candidate to one of the sessions.In this work, we define the problem formulation that applies to some Ital
Autor:
Michele Battistutta, Fabio De Cesco, Elena Topan, Andrea Schaerf, Sara Ceschia, Luca Di Gaspero
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR
CPAIOR
We investigate the examination timetabling problem in the context of Italian universities. The outcome is the definition of a general problem that can be applied to a large set of universities, but is quite different in many aspects from the classica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05e9a179a577ca87c43d543a1aca5905
http://hdl.handle.net/11390/1193257
http://hdl.handle.net/11390/1193257
Autor:
Luca Di Gaspero
Publikováno v:
Springer Handbook of Computational Intelligence ISBN: 9783662435045
Handbook of Computational Intelligence
Handbook of Computational Intelligence
A promising research line in the optimization community regards the hybridization of exact and heuristics methods. In this chapter we survey the specific integration of two complementary optimization paradigms, namely Constraint Programming, for the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::484c316add0c6bd01d07ad15e4887b3b
https://doi.org/10.1007/978-3-662-43505-2_62
https://doi.org/10.1007/978-3-662-43505-2_62
We propose an extension of the Generalized Balanced Academic Curriculum Problem (GBACP), a relevant planning problem arising in many universities. The problem consists of assigning courses to teaching terms and years, satisfying a set of precedence c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6eeaa91f84540946ef163d00dd59ddb7
http://hdl.handle.net/11390/892742
http://hdl.handle.net/11390/892742
Publikováno v:
Chiarandini, M, Di Gaspero, L, Gualandi, S & Schaerf, A 2012, ' The balanced academic curriculum problem revisited ', Journal of Heuristics, bind 18, nr. 1, s. 119-148 . https://doi.org/10.1007/s10732-011-9158-2
The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to teaching terms satisfying prerequisites and balancing the credit course load within each term. The BACP is part of the CSPLib with three benchmark instances, but its for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::176332843c05d058252a156f0829ad2b
http://hdl.handle.net/11390/878159
http://hdl.handle.net/11390/878159
Autor:
Nysret Musliu, Johannes Gärtner, Wolfgang Slany, Andrea Schaerf, Guy Kortsarz, Luca Di Gaspero
Publikováno v:
BASE-Bielefeld Academic Search Engine
The min-Shift Design problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the number of employees to be assigned to these shifts in order to minimize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::081a9f9a52b635ce6d6918296b78d2b4
http://hdl.handle.net/10.1007/s10479-007-0221-1
http://hdl.handle.net/10.1007/s10479-007-0221-1