Vns

Effective Neighborhood Structures for the Generalized Traveling Salesman Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2008 (Jano van Hemert and Carlos Cotta), volume 4972 of LNCS, pages 36-47, 2008, Springer.
Note: best paper award winner
PDF Cite
Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees
BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.
PDF Cite
Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms
GECCO ‘08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer and others), pages 323-330, 2008, ACM.
PDF Cite
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
Proceedings of the 8th International Conference on Hybrid Intelligent Systems – HIS~2008 (Fatos Xhafa and others), pages 73-77, 2008.
PDF Cite
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 233-236, 2008, IEEE Computer Society.
PDF Cite DOI
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF Cite
The Multidimensional Knapsack Problem: Structure and Algorithms
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF Cite
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem
Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz), pages 69/1-6, 2007.
PDF Cite
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
2006, Technical report TR 186-1-06-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF Cite
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
2006, Technical report TR 186-1-06-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF Cite