<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Article-Journal | Intelligent Optimization Lab</title><link>https://iolab.uniud.it/publication-type/article-journal/</link><atom:link href="https://iolab.uniud.it/publication-type/article-journal/index.xml" rel="self" type="application/rss+xml"/><description>Article-Journal</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-US</language><lastBuildDate>Wed, 01 Apr 2026 00:00:00 +0000</lastBuildDate><image><url>https://iolab.uniud.it/media/logo_hu_1bf0f7e2664ed9eb.png</url><title>Article-Journal</title><link>https://iolab.uniud.it/publication-type/article-journal/</link></image><item><title>Large Language Models for Combinatorial Optimization: A Systematic Review</title><link>https://iolab.uniud.it/publication/dsdr-2026/</link><pubDate>Wed, 01 Apr 2026 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dsdr-2026/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Behavior and representation in open-weight Large Language Models for combinatorial optimization: From feature extraction to algorithm selection</title><link>https://iolab.uniud.it/publication/daros-2026107603/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/daros-2026107603/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Corrigendum to ``Multi-neighborhood simulated annealing for the oven scheduling problem'' [Comput. Oper. Res. 177 (2025) 106999]</title><link>https://iolab.uniud.it/publication/da-ros-2026-corr/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/da-ros-2026-corr/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Multi-neighborhood simulated annealing for the home healthcare routing and scheduling problem</title><link>https://iolab.uniud.it/publication/ceschia-2026-mu/</link><pubDate>Thu, 01 Jan 2026 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ceschia-2026-mu/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>A unified formulation for home healthcare routing and scheduling problems</title><link>https://iolab.uniud.it/publication/ceschia-2025-hc/</link><pubDate>Mon, 01 Dec 2025 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ceschia-2025-hc/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Multi-neighborhood simulated annealing for the oven scheduling problem</title><link>https://iolab.uniud.it/publication/da-ros-2025-jo/</link><pubDate>Thu, 01 May 2025 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/da-ros-2025-jo/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Preface to the Special Issue on Metaheuristics: Recent Advances and Applications</title><link>https://iolab.uniud.it/publication/fdpr-25-preface/</link><pubDate>Wed, 01 Jan 2025 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/fdpr-25-preface/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Supporting Fair and Efficient Emergency Medical Services in a Large Heterogeneous Region</title><link>https://iolab.uniud.it/publication/ddrl-24/</link><pubDate>Sat, 01 Jun 2024 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ddrl-24/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities</title><link>https://iolab.uniud.it/publication/ce-sc-24/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-sc-24/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Solving the medical student scheduling problem using simulated annealing</title><link>https://iolab.uniud.it/publication/zcds-24/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/zcds-24/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Educational timetabling: Problems, benchmarks, and state-of-the-art results</title><link>https://iolab.uniud.it/publication/ce-ds-22/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-ds-22/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Exact and metaheuristic methods for a real-world examination timetabling problem</title><link>https://iolab.uniud.it/publication/ccdm-23/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ccdm-23/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Solving a real-world nurse rostering problem by Simulated Annealing</title><link>https://iolab.uniud.it/publication/cdmps-23/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cdmps-23/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The on-demand warehousing problem</title><link>https://iolab.uniud.it/publication/cgmm-22/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cgmm-22/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Algorithm selection and instance space analysis for curriculum-based course timetabling</title><link>https://iolab.uniud.it/publication/dmsss-22/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dmsss-22/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Exact and metaheuristic approaches for unrelated parallel machine scheduling</title><link>https://iolab.uniud.it/publication/mmsw-21/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/mmsw-21/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities</title><link>https://iolab.uniud.it/publication/mrpv-22/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/mrpv-22/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021</title><link>https://iolab.uniud.it/publication/rpds-22/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/rpds-22/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Task design in complex crowdsourcing experiments: Item assignment optimization</title><link>https://iolab.uniud.it/publication/crdm-22/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/crdm-22/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>An extended regularized adjusted plus-minus analysis for lineup management in basketball using play-by-play data</title><link>https://iolab.uniud.it/publication/10-1093-imamandpaa-022/</link><pubDate>Fri, 01 Oct 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/10-1093-imamandpaa-022/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Preface: The practice and theory of automated timetabling (2018)</title><link>https://iolab.uniud.it/publication/ozcan-2018/</link><pubDate>Thu, 01 Jul 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ozcan-2018/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local search approaches for the test laboratory scheduling problem with variable task grouping</title><link>https://iolab.uniud.it/publication/mi-ns-21/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/mi-ns-21/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Modelling and Solving Patient Admission and Hospital Stay Problems</title><link>https://iolab.uniud.it/publication/gu-cc-21/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/gu-cc-21/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Multi-Neighborhood Simulated Annealing for the Minimum Interference Frequency Assignment Problem</title><link>https://iolab.uniud.it/publication/cdrs-21/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cdrs-21/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Solving a home energy management problem by Simulated Annealing</title><link>https://iolab.uniud.it/publication/ba-cs-21/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ba-cs-21/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling</title><link>https://iolab.uniud.it/publication/be-cds-21/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/be-cds-21/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Energy-efficient frozen food transports: the Refrigerated Routing Problem</title><link>https://iolab.uniud.it/publication/me-ce-19-b/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/me-ce-19-b/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Extending and Solving the Refrigerated Routing Problem</title><link>https://iolab.uniud.it/publication/cdgm-20/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cdgm-20/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Modeling and solving the steelmaking and casting scheduling problem</title><link>https://iolab.uniud.it/publication/abcds-20/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/abcds-20/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods</title><link>https://iolab.uniud.it/publication/ce-gs-20/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-gs-20/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The practice and theory of automated timetabling (2016)</title><link>https://iolab.uniud.it/publication/ozcan-2019-aa/</link><pubDate>Mon, 01 Apr 2019 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ozcan-2019-aa/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Modeling and Solving the Thesis Defense Timetabling Problem</title><link>https://iolab.uniud.it/publication/bcdds-19/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/bcdds-19/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The Second International Nurse Rostering Competition</title><link>https://iolab.uniud.it/publication/cddhs-18/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cddhs-18/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Feature-based tuning of single-stage simulated annealing for examination timetabling</title><link>https://iolab.uniud.it/publication/ba-st-15/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ba-st-15/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Modeling and solving a real-life multi-skill shift design problem</title><link>https://iolab.uniud.it/publication/bcms-16/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/bcms-16/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Solving Discrete Lot-Sizing and Scheduling by Simulated Annealing and Mixed Integer Programming</title><link>https://iolab.uniud.it/publication/ce-ds-17/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-ds-17/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Balancing Bike Sharing Systems with Constraint Programming</title><link>https://iolab.uniud.it/publication/di-ru-15/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-ru-15/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays</title><link>https://iolab.uniud.it/publication/ce-sc-16/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-sc-16/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem</title><link>https://iolab.uniud.it/publication/be-cdsu-15-a/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/be-cdsu-15-a/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The Third International Timetabling Competition</title><link>https://iolab.uniud.it/publication/pdkms-2013/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/pdkms-2013/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>An Investigation on Swarm Intelligence Methods for the Optimization of Complex Part Programs in CNC Turning</title><link>https://iolab.uniud.it/publication/so-be-tdn-15/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/so-be-tdn-15/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Comments on: An overview of curriculum-based course timetabling</title><link>https://iolab.uniud.it/publication/scha-15/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-15/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The first international nurse rostering competition 2010</title><link>https://iolab.uniud.it/publication/hdss-14/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/hdss-14/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The generalized balanced academic curriculum problem with heterogeneous classes</title><link>https://iolab.uniud.it/publication/cdgs-14/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cdgs-14/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>XHSTT: an XML archive for high school timetabling problems in different countries</title><link>https://iolab.uniud.it/publication/pkad-14/</link><pubDate>Wed, 01 Jan 2014 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/pkad-14/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local search algorithms for integrated logistics</title><link>https://iolab.uniud.it/publication/cesc-13/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cesc-13/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local search for a multi-drop multi-container loading problem</title><link>https://iolab.uniud.it/publication/ce-sc-11-b/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-sc-11-b/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local search techniques for a routing-packing problem</title><link>https://iolab.uniud.it/publication/ce-ss-13/</link><pubDate>Tue, 01 Jan 2013 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-ss-13/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results</title><link>https://iolab.uniud.it/publication/bdds-12/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/bdds-12/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Design and Statistical Analysis of a Hybrid Local Search Algorithm for Course Timetabling</title><link>https://iolab.uniud.it/publication/be-ds-11/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/be-ds-11/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem</title><link>https://iolab.uniud.it/publication/cdgs-11-b/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cdgs-11-b/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Modeling and solving the dynamic patient admission scheduling problem under uncertainty</title><link>https://iolab.uniud.it/publication/ce-sc-12-d/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-sc-12-d/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The Balanced Academic Curriculum Problem Revisited</title><link>https://iolab.uniud.it/publication/ch-dgs-12/</link><pubDate>Sun, 01 Jan 2012 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ch-dgs-12/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Hybrid Metaheuristics for Constrained Portfolio Selection Problem</title><link>https://iolab.uniud.it/publication/di-str-11/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-str-11/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local Search and Lower Bounds for the Patient Admission Scheduling Problem</title><link>https://iolab.uniud.it/publication/ce-sc-12-a/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-sc-12-a/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Tabu Search Techniques for the Heterogeneous Vehicle Routing Problem with Time Windows and Carrier-Dependent Costs</title><link>https://iolab.uniud.it/publication/ce-ds-11/</link><pubDate>Sat, 01 Jan 2011 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ce-ds-11/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition</title><link>https://iolab.uniud.it/publication/mspm-09/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/mspm-09/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The Context-Aware Browser</title><link>https://iolab.uniud.it/publication/cddm-10/</link><pubDate>Fri, 01 Jan 2010 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cddm-10/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Stochastic local search for large-scale instances of the Haplotype Inference Problem by Pure Parsimony</title><link>https://iolab.uniud.it/publication/di-ro-08/</link><pubDate>Tue, 01 Jan 2008 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-ro-08/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>A Composite-Neighborhood Tabu Search Approach to the Traveling Tournament Problem</title><link>https://iolab.uniud.it/publication/di-sc-07/</link><pubDate>Sun, 01 Apr 2007 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-sc-07/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>The minimum shift design problem</title><link>https://iolab.uniud.it/publication/dgkmss-07/</link><pubDate>Mon, 01 Jan 2007 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dgkmss-07/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Measuring Retrieval Effectiveness with Average Distance Measure (ADM)</title><link>https://iolab.uniud.it/publication/dddm-06-b/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dddm-06-b/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Neighborhood Portfolio Approach for Local Search applied to Timetabling Problems</title><link>https://iolab.uniud.it/publication/di-sc-06/</link><pubDate>Sun, 01 Jan 2006 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-sc-06/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Compiling problem specifications into SAT</title><link>https://iolab.uniud.it/publication/ca-sc-05/</link><pubDate>Sat, 01 Jan 2005 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/ca-sc-05/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Il problema della generazione automatica dell'orario delle lezioni: teoria e pratica</title><link>https://iolab.uniud.it/publication/di-sc-04-b/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-sc-04-b/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local Search for Shift Design</title><link>https://iolab.uniud.it/publication/mu-ss-04/</link><pubDate>Thu, 01 Jan 2004 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/mu-ss-04/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>textscEasyLocal++: An object-oriented framework for flexible design of local search algorithms</title><link>https://iolab.uniud.it/publication/di-sc-03/</link><pubDate>Tue, 01 Jul 2003 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/di-sc-03/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Modelling and Solving Employee Timetabling Problems</title><link>https://iolab.uniud.it/publication/me-sc-03/</link><pubDate>Wed, 01 Jan 2003 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/me-sc-03/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local Search Techniques for Constrained Portfolio Selection Problems</title><link>https://iolab.uniud.it/publication/scha-02/</link><pubDate>Tue, 01 Jan 2002 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-02/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>textscLocal++: A C++ Framework for Local Search Algorithms</title><link>https://iolab.uniud.it/publication/sc-cl-00/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/sc-cl-00/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>textscNP-Spec: An Executable Specification Language for Solving All Problems in NP</title><link>https://iolab.uniud.it/publication/cipsv-00/</link><pubDate>Sat, 01 Jan 2000 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/cipsv-00/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>A Survey of Automated Timetabling</title><link>https://iolab.uniud.it/publication/scha-99/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-99/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Internet Agents for telemedicine services</title><link>https://iolab.uniud.it/publication/drcd-99/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/drcd-99/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Local Search Techniques for Large High-School Timetabling Problems</title><link>https://iolab.uniud.it/publication/scha-99-c/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-99-c/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Scheduling Sport Tournaments using Constraint Logic Programming</title><link>https://iolab.uniud.it/publication/scha-99-b/</link><pubDate>Fri, 01 Jan 1999 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-99-b/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>$mathcalAL$-log: integrating datalog and description logics</title><link>https://iolab.uniud.it/publication/dlns-96/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dlns-96/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>A Refined Architecture for Terminological Systems: Terminology = Schema + Views</title><link>https://iolab.uniud.it/publication/bdns-98/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/bdns-98/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Adding epistemic operators to description logics</title><link>https://iolab.uniud.it/publication/dlnns-98/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dlnns-98/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>textsfAlma-0: An Imperative Language that Supports Declarative Programming</title><link>https://iolab.uniud.it/publication/abps-98/</link><pubDate>Thu, 01 Jan 1998 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/abps-98/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Adaptive load balancing: a study in multi-agent learning</title><link>https://iolab.uniud.it/publication/sc-st-95/</link><pubDate>Sun, 01 Jan 1995 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/sc-st-95/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Deduction in concept languages: From subsumption to instance checking</title><link>https://iolab.uniud.it/publication/dlns-94/</link><pubDate>Sat, 01 Jan 1994 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/dlns-94/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Reasoning with individuals in concept languages</title><link>https://iolab.uniud.it/publication/scha-94/</link><pubDate>Sat, 01 Jan 1994 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-94/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>Decidable reasoning in terminological knowledge representation systems</title><link>https://iolab.uniud.it/publication/bu-ds-93/</link><pubDate>Fri, 01 Jan 1993 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/bu-ds-93/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item><item><title>On the complexity of the instance checking problem in concept languages with existential quantification</title><link>https://iolab.uniud.it/publication/scha-93/</link><pubDate>Fri, 01 Jan 1993 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/publication/scha-93/</guid><description>&lt;p&gt;Add the &lt;strong&gt;full text&lt;/strong&gt; or &lt;strong&gt;supplementary notes&lt;/strong&gt; for the publication here using Markdown formatting.&lt;/p&gt;</description></item></channel></rss>