Benedikt Klocker

Recent Publications

Combinatorial Optimization Approaches for Graph Construction Problems
April 2020, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by Günther~R.~Raidl
A Model for Finding Transition-Minors
Discrete Applied Mathematics, volume 228, pages 242-264, 2020.
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
April 2019, Master’s thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
A SAT Approach for Finding Sup-Transition-Minors
Learning and Intelligent Optimization. LION~2019, volume 11968 of LNCS, pages 325-341, 2019, Springer.
A Model for Finding Transition-Minors
2018, Technical report AC-TR-18-009, Algorithms and Complexity Group, TU Wien.
A SAT Approach for Finding Sup-Transition-Minors
2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien.
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa and Christian Blum and Angelo Cangelosi and Vicenzo Cutello and Alessandro Di Nuovo and Mario Pavone and El-Ghazali Talbi), volume 9668 of LNCS, pages 1-16, 2016, Springer.
Optimization Approaches for Recreational Bicycle Tour Planning
April 2015, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by M. Prandtstetter and G. Raidl