<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithm Selection | Intelligent Optimization Lab</title><link>https://iolab.uniud.it/tag/algorithm-selection/</link><atom:link href="https://iolab.uniud.it/tag/algorithm-selection/index.xml" rel="self" type="application/rss+xml"/><description>Algorithm Selection</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-US</language><lastBuildDate>Sat, 26 Sep 2026 00:00:00 +0000</lastBuildDate><image><url>https://iolab.uniud.it/media/logo_hu_1bf0f7e2664ed9eb.png</url><title>Algorithm Selection</title><link>https://iolab.uniud.it/tag/algorithm-selection/</link></image><item><title>Large Language Models for Optimization</title><link>https://iolab.uniud.it/research/llm-optimization/</link><pubDate>Sat, 26 Sep 2026 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/research/llm-optimization/</guid><description>&lt;p&gt;IOLab investigates how large language models can complement established combinatorial optimization techniques. Rather than treating an LLM as a stand-alone solver, we study its role as one component of a structured optimization system.&lt;/p&gt;
&lt;p&gt;Our work examines LLM-based generative operators within metaheuristics, the ability of models to recall and interpret problem features, and the information encoded in their internal representations. These representations can be evaluated as surrogates for predicting instance difficulty and algorithm behavior in algorithm-selection scenarios.&lt;/p&gt;
&lt;p&gt;The group has published a &lt;a href="https://iolab.uniud.it/publication/dsdr-2026/"&gt;systematic review of LLMs for combinatorial optimization&lt;/a&gt; and experimental work on &lt;a href="https://iolab.uniud.it/publication/daros-2026107603/"&gt;feature extraction and algorithm selection&lt;/a&gt;.&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>Automated Algorithm Selection in Optimization and Machine Learning</title><link>https://iolab.uniud.it/event/automated-algorithm-selection/</link><pubDate>Thu, 05 Oct 2023 09:30:00 +0200</pubDate><guid>https://iolab.uniud.it/event/automated-algorithm-selection/</guid><description>&lt;p&gt;&lt;strong&gt;Nysret Musliu&lt;/strong&gt; is with the Christian Doppler Laboratory for AI and Optimization in Planning and Scheduling at the Institute of Logic and Computation, Technische Universität Wien, Austria.&lt;/p&gt;
&lt;p&gt;The course is organized in three sessions:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;5 October 2023, 9:30-12:30&lt;/li&gt;
&lt;li&gt;5 October 2023, 14:00-17:00&lt;/li&gt;
&lt;li&gt;6 October 2023, 9:30-11:30&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Industrial Production Scheduling</title><link>https://iolab.uniud.it/project/industrial-production-scheduling/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://iolab.uniud.it/project/industrial-production-scheduling/</guid><description>&lt;p&gt;IOLab develops optimization methods for complex production environments, where scheduling decisions must account for technological constraints, limited resources, energy consumption, and operational objectives.&lt;/p&gt;
&lt;p&gt;From 2017 to 2021, the group conducted a research collaboration with &lt;strong&gt;Danieli Automation&lt;/strong&gt; on production scheduling for steel plants. Led by Luca Di Gaspero, the project studied metaheuristic methods for industrial decision-support systems in an Industry 4.0 setting.&lt;/p&gt;
&lt;p&gt;More recent work investigates the &lt;strong&gt;Oven Scheduling Problem&lt;/strong&gt; and related parallel-batch scheduling models. The group has developed local-search and large-neighborhood-search methods, as well as instance-space analysis and algorithm-selection techniques for understanding when different algorithms perform best.&lt;/p&gt;
&lt;p&gt;Code and experimental data are available through the &lt;a href="https://github.com/iolab-uniud/osp-ls" target="_blank" rel="noopener"&gt;OSP-LS&lt;/a&gt; and &lt;a href="https://github.com/iolab-uniud/osp-lns" target="_blank" rel="noopener"&gt;OSP-LNS&lt;/a&gt; repositories.&lt;/p&gt;</description></item></channel></rss>