abstracts.bib

@comment{{This file has been generated by bib2bib 1.99}}

@comment{{Command line: bib2bib --expand -ob abstracts.bib -oc abstracts-list.bib ../all-entries.bib -c '(author:"Chiarandini") and ($type="INPROCEEDINGS") and (comment:"^Abstract")'}}

@inproceedings{Chiarandini2013a,
  author = {Marco Chiarandini},
  title = {A Web Platform for Problem Solving Competitions},
  booktitle = {Assessment, Feedback and Learning Conference},
  year = {2013},
  editor = {Birgitta Wallstedt and Rie Troelsen},
  pages = {6},
  address = {Odense},
  month = {November},
  organization = {University of Southern Denmark},
  comment = {Abstract},
  keywords = {Autoassessment, e-learning tools, competition-based learning, writing
	assignments, student motivation},
  owner = {marco},
  timestamp = {2013.11.26},
  url = {http://static.sdu.dk/mediafiles//A/1/B/%7BA1B9CF80-8BD1-4D78-BA35-25ECC6D3133E%7DKonferencepublikation%202.0%20-%20rettet.pdf#page=8&zoom=auto,54,756},
  urlpdf = {https://www.imada.sdu.dk/u/marco/Publications/Files/Chiarandini2013a.pdf}
}

@inproceedings{Chiarandini2012b,
  author = {Marco Chiarandini},
  title = {Planning in Education: Some Challenging Scheduling Problems},
  booktitle = {EU/MEeting 2012: Metaheuristics for global challenges},
  year = {2012},
  address = {Copenhagen},
  month = {May},
  organization = {Technical University of Denmark (DTU)},
  comment = {Abstract},
  file = {eume2012.pdf:./Files/eume2012.pdf:PDF},
  owner = {marco},
  timestamp = {2012.09.26},
  url = {http://webhost.ua.ac.be/eume/workshops/eume12-copenhagen/},
  urlpdf = {./Files/EUME2012.pdf}
}

@inproceedings{Chiarandini2012a,
  author = {Marco Chiarandini and Niels Kjeldsen and Napole{\~a}o Nepomuceno},
  title = {Benders decomposition for an integrated biomass logistics problem},
  booktitle = {Third International Conference on Computational Sustainability (CompSust'12)},
  year = {2012},
  citeseerurl = {http://www.computational-sustainability.org/compsust12},
  comment = {Abstract},
  owner = {marco},
  timestamp = {2012.09.26},
  url = {./Files/compsust.pdf}
}

@inproceedings{ChiStuBir05,
  author = {M. Chiarandini and T. St\"utzle and M. Birattari},
  title = {Applying Stochastic Local Search Methods to Timetabling: an Engineering
	Process},
  month = {September},
  year = {2005},
  comment = {Abstract},
  booktitle = {XXXVI Annual Conference of the Italian Operational Research Society},
  keywords = {Chiarandini},
  opturl = {Files/talk-AIRO2005.pdf},
  pages = {74}
}

@inproceedings{euro2025,
  author = {Ahmad Mahir Othman and Marco Chiarandini},
  title = {A multi-neighborhood, lexicographic local search algorithm for the Integrated Healthcare Timetabling Competition 2024},
  optcrossref = {},
  booktitle = {EURO 2025, Technical Program},
  year = {2025},
  abstract = {The Integrated Healthcare Timetabling Competition 2024 (IHTC-
2024) focused on the integration of three decision-making tasks: pa-
tient admission scheduling, operating theater planning and nurse-to-
room assignment. The algorithm we submitted builds upon the ROAR-
NET API specification and consists of a classical local search heuristic
that uses multiple, small-scale neighborhood structures to address the
different decision tasks and handles hard and soft constraint violations
lexicographically.
Efficiency has been the primary guideline for the implementation. The
search space is reduced by adopting a solution representation that im-
plicitly satisfies some hard constraints. Patients are restricted to only
be admitted on dates and rooms that satisfy the hard constraints affect-
ing them independently from other decisions. Neighboring solutions
are assessed incrementally over all neighborhood structures. Finally,
Python was replaced by C++ after the first draft of the solver.
The high-level search strategy shares the run time between simulated
annealing, first, for exploration and iterated local search, later, for
exploitation. To take advantage of the 4-threads made available by
the rule of the competition, we selected, offline, a set of four algo-
rithm configurations and schedules by solving optimally a sequence of
set covering problems with cardinality constraints. Our entry ranked
among the best five out of 32 submissions.
},
  comment = {Abstract},
  editor = {Rita Laura D'Ecclesia},
  optvolume = {},
  optnumber = {},
  optseries = {},
  optpages = {1-3},
  optmonth = {},
  address = {University of Leeds, UK},
  optorganization = {},
  optpublisher = {},
  optnote = {},
  optannote = {}
}

@comment{{jabref-meta: databaseType:biblatex;}}

@comment{{jabref-meta: grouping:
0 AllEntriesGroup:;
1 StaticGroup:Markings\;2\;1\;\;\;\;;
2 StaticGroup:[marco]\;2\;1\;\;\;\;;
}}