Stefan Hougardy

Rheinische Friedrich-Wilhelms-Universität Bonn

H-index: 24

Europe-Germany

About Stefan Hougardy

Stefan Hougardy, With an exceptional h-index of 24 and a recent h-index of 14 (since 2020), a distinguished researcher at Rheinische Friedrich-Wilhelms-Universität Bonn, specializes in the field of combinatorial optimization.

His recent articles reflect a diverse array of research interests and contributions to the field:

The Bottom-Left Algorithm for the Strip Packing Problem

The -Opt algorithm for the Traveling Salesman Problem has exponential running time for

Local elimination in the traveling salesman problem

A fast optimal double-row legalization algorithm

The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem

Hard to solve instances of the Euclidean Traveling Salesman Problem

The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem

Stefan Hougardy Information

University	Rheinische Friedrich-Wilhelms-Universität Bonn
Position	Professor of Mathematics
Citations(all)	2147
Citations(since 2020)	699
Cited By	2303
hIndex(all)	24
hIndex(since 2020)	14
i10Index(all)	45
i10Index(since 2020)	18
Email	Access Email
University Profile Page	Rheinische Friedrich-Wilhelms-Universität Bonn
Google Scholar	View Google Scholar Profile

Stefan Hougardy Skills & Research Interests

combinatorial optimization

Top articles of Stefan Hougardy

Title	Journal	Author(s)	Publication Date
The Bottom-Left Algorithm for the Strip Packing Problem	arXiv preprint arXiv:2402.16572	Stefan Hougardy Bart Zondervan	2024/2/26
The -Opt algorithm for the Traveling Salesman Problem has exponential running time for	arXiv preprint arXiv:2402.07061	Sophia Heimann Hung P Hoang Stefan Hougardy	2024/2/10
Local elimination in the traveling salesman problem	arXiv preprint arXiv:2307.07054	William Cook Keld Helsgaun Stefan Hougardy Rasmus T Schroeder	2023/7/13
A fast optimal double-row legalization algorithm	ACM Transactions on Design Automation of Electronic Systems	Stefan Hougardy Meike Neuwohner Ulrike Schorr	2023/9/8
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem	SIAM Journal on Computing	Ulrich A Brodowsky Stefan Hougardy Xianghui Zhong	2023/8/31
Hard to solve instances of the Euclidean Traveling Salesman Problem	Mathematical Programming Computation	Stefan Hougardy Xianghui Zhong	2021/3
The approximation ratio of the 2-Opt Heuristic for the metric Traveling Salesman Problem	Operations Research Letters	Stefan Hougardy Fabian Zaiser Xianghui Zhong	2020/7/1