<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Elina Rönnberg | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/elina-ronnberg/</link><atom:link href="https://ac.tuwien.ac.at/team/elina-ronnberg/index.xml" rel="self" type="application/rss+xml"/><description>Elina Rönnberg</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2024 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Elina Rönnberg</title><link>https://ac.tuwien.ac.at/team/elina-ronnberg/</link></image><item><title>Scheduling Jobs Using Queries to Interactively Learn Human Availability Times</title><link>https://ac.tuwien.ac.at/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/scheduling-jobs-using-queries-to-interactively-learn-human-availability-times/</guid><description/></item><item><title>Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks</title><link>https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-strengthening-cuts-with-graph-neural-networks/</guid><description/></item><item><title>Interactive Job Scheduling with Partially Known Personnel Availabilities</title><link>https://ac.tuwien.ac.at/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/</link><pubDate>Sun, 01 Jan 2023 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/interactive-job-scheduling-with-partially-known-personnel-availabilities/</guid><description/></item><item><title>A Learning Large Neighborhood Search for the Staff Rerostering Problem</title><link>https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem/</guid><description/></item><item><title>A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources</title><link>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources/</guid><description/></item><item><title>A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem/</guid><description/></item><item><title>A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources</title><link>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-search-for-prize-collecting-job-sequencing-with-one-common-and-multiple-secondary-resources-2/</guid><description/></item><item><title>A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-based-construction-of-decision-diagrams-for-a-prize-collecting-scheduling-problem-2/</guid><description/></item><item><title>An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows</title><link>https://ac.tuwien.ac.at/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-a-algorithm-for-solving-a-prize-collecting-sequencing-problem-with-one-common-and-multiple-secondary-resources-and-time-windows/</guid><description/></item></channel></rss>