<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Martin Riedler | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/martin-riedler/</link><atom:link href="https://ac.tuwien.ac.at/team/martin-riedler/index.xml" rel="self" type="application/rss+xml"/><description>Martin Riedler</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 01 Jan 2020 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Martin Riedler</title><link>https://ac.tuwien.ac.at/team/martin-riedler/</link></image><item><title>An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem-2/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem-2/</guid><description/></item><item><title>Strategies for Iteratively Refining Layered Graph Models</title><link>https://ac.tuwien.ac.at/publication/strategies-for-iteratively-refining-layered-graph-models/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/strategies-for-iteratively-refining-layered-graph-models/</guid><description/></item><item><title>Advances in Decomposition Approaches for Mixed Integer Linear Programming</title><link>https://ac.tuwien.ac.at/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/</link><pubDate>Thu, 01 Nov 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/</guid><description/></item><item><title>Exact approaches for the directed network design problem with relays</title><link>https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays-2/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays-2/</guid><description/></item><item><title>Exact approaches for the directed network design problem with relays</title><link>https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-approaches-for-the-directed-network-design-problem-with-relays/</guid><description/></item><item><title>Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition</title><link>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/</link><pubDate>Mon, 01 Jan 2018 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition/</guid><description/></item><item><title>An Iterative Time-Bucket Refinement Algorithm for a High Resolution Resource-Constrained Project Scheduling Problem</title><link>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-a-high-resolution-resource-constrained-project-scheduling-problem/</guid><description/></item><item><title>Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments</title><link>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/</link><pubDate>Sun, 01 Jan 2017 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-time-estimation-to-schedule-sets-of-treatments/</guid><description/></item><item><title>Particle Therapy Patient Scheduling: First Heuristic Approaches</title><link>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/particle-therapy-patient-scheduling-first-heuristic-approaches/</guid><description/></item><item><title>Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition</title><link>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-a-selective-dial-a-ride-problem-with-logic-based-benders-decomposition-2/</guid><description/></item><item><title>Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics</title><link>https://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/</link><pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/time-bucket-relaxation-based-mixed-integer-programming-models-for-scheduling-problems-a-promising-starting-point-for-matheuristics/</guid><description/></item><item><title>Exact Approaches for Network Design Problems with Relays</title><link>https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays-2/</link><pubDate>Thu, 01 Jan 2015 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/exact-approaches-for-network-design-problems-with-relays-2/</guid><description/></item></channel></rss>