<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Matthias Horn | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/matthias-horn/</link><atom:link href="https://ac.tuwien.ac.at/team/matthias-horn/index.xml" rel="self" type="application/rss+xml"/><description>Matthias Horn</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 Jan 2021 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Matthias Horn</title><link>https://ac.tuwien.ac.at/team/matthias-horn/</link></image><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>Driver Shift Planning for an Online Store with Short Delivery Times</title><link>https://ac.tuwien.ac.at/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/driver-shift-planning-for-an-online-store-with-short-delivery-times/</guid><description/></item><item><title>Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines</title><link>https://ac.tuwien.ac.at/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/route-duration-prediction-in-a-stochastic-and-dynamic-vehicle-routing-problem-with-short-delivery-deadlines/</guid><description/></item><item><title>A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem</title><link>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem/</guid><description/></item><item><title>Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem-2/</guid><description/></item><item><title>On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences</title><link>https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/</guid><description/></item><item><title>A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-scheduling-problem/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/a-biased-random-key-genetic-algorithm-with-rollout-evaluations-for-the-resource-constraint-job-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>Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem</title><link>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/</guid><description/></item><item><title>Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm</title><link>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-an-a-beam-search-based-anytime-algorithm/</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><item><title>Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment</title><link>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/job-sequencing-with-one-common-and-multiple-secondary-resources-a-problem-motivated-from-particle-therapy-for-cancer-treatment/</guid><description/></item></channel></rss>