Benedikt Klocker

» Project Assistant (FWF), Dipl.-Ing.

Address:
Benedikt Klocker
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room:	HA0410 (how to get there)
Phone:	+43(1)58801–192123
Email:	klocker@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/klocker/

Publications

7 results

2019
[7]	A SAT Approach for Finding Sup-Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther R. Raidl Learning and Intelligent Optimization. LION 2019, volume 11968url=https://www.ac.tuwien.ac.at/files/pub/klocker-19a.pdf of LNCS, pages 325–341, 2019, Springer. [bibtex]
[6]	Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Benedikt Klocker apr 2019, Master's thesis, TU Wien, Institute of Logic and Computation. Note: supervised by G. Raidl [bibtex] [pdf]
2018
[5]	Finding Smooth Graphs with Small Independence Numbers Benedikt Klocker, Herbert Fleischner, Günther R. Raidl MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer. [bibtex] [pdf]
[4]	Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Benedikt Klocker, Günther R Raidl Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 355-363, 2018, Springer. [bibtex] [pdf]
2017
[3]	Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging Benedikt Klocker, Günther R Raidl Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017. [bibtex] [pdf]
2016
[2]	Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers Benedikt Klocker, Herbert Fleischner, Günther R. Raidl Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer. [bibtex] [pdf]
2015
[1]	Optimization Approaches for Recreational Bicycle Tour Planning Benedikt Klocker Apr 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms. Note: supervised by M. Prandtstetter and G. Raidl [bibtex] [pdf]

Technical Reports

3 results

2019
[3]	A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three Benedikt Klocker, Herbert Fleischner, Günther R. Raidl 2019, Technical report AC-TR-19-007, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
2018
[2]	A SAT Approach for Finding Sup-Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther Raidl 2018, Technical report AC-TR-18-010, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]
[1]	A Model for Finding Transition-Minors Benedikt Klocker, Herbert Fleischner, Günther Raidl 2018, Technical report AC-TR-18-009, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]