Benedikt Klocker | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/benedikt-klocker/Benedikt KlockerHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Apr 2020 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngBenedikt Klockerhttps://ac.tuwien.ac.at/team/benedikt-klocker/Combinatorial Optimization Approaches for Graph Construction Problemshttps://ac.tuwien.ac.at/publication/combinatorial-optimization-approaches-for-graph-construction-problems/Wed, 01 Apr 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-optimization-approaches-for-graph-construction-problems/A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Threehttps://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three/A Model for Finding Transition-Minorshttps://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors/Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merginghttps://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-3/Mon, 01 Apr 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-3/A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Threehttps://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lower-bound-for-the-smallest-uniquely-hamiltonian-planar-graph-with-minimum-degree-three-2/A SAT Approach for Finding Sup-Transition-Minorshttps://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors/A Model for Finding Transition-Minorshttps://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-model-for-finding-transition-minors-2/A SAT Approach for Finding Sup-Transition-Minorshttps://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-sat-approach-for-finding-sup-transition-minors-2/Finding Smooth Graphs with Small Independence Numbershttps://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-smooth-graphs-with-small-independence-numbers/Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merginghttps://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-2/Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merginghttps://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging/Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbershttps://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-uniquely-hamiltonian-graphs-of-minimum-degree-three-with-small-crossing-numbers/Optimization Approaches for Recreational Bicycle Tour Planninghttps://ac.tuwien.ac.at/publication/optimization-approaches-for-recreational-bicycle-tour-planning/Wed, 01 Apr 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-approaches-for-recreational-bicycle-tour-planning/