| | Preview | Author(s) | Title | Type | Issue Date |
| 21 | | Biesinger, Benjamin ; Schauer, Christian ; Hu, Bin ; Raidl, Günther | Reconstructing cross cut shredded documents with a genetic algorithm with solution archive | Konferenzbeitrag Inproceedings | 2013 |
| 22 | | Papazek, Petrina ; Raidl, Günther ; Rainer-Harbach, Marian ; Hu, Bin | A pilot/vnd/grasp hybrid for balancing bicycle sharing systems | Konferenzbeitrag Inproceedings | 2013 |
| 23 | | Hu, Bin ; Ölz, Werner ; Raidl, Günther | A mixed integer model for the stamina-aware sightseeing tour problem | Konferenzbeitrag Inproceedings | 2013 |
| 24 | | Pop, Petrica ; Hu, Bin ; Raidl, Günther | A memetic algorithm for the partition graph coloring problem | Konferenzbeitrag Inproceedings | 2013 |
| 25 | | Rainer-Harbach, Marian ; Papazek, Petrina ; Hu, Bin ; Raidl, Günther | Balancing bicycle sharing systems: A variable neighborhood search approach | Konferenzbeitrag Inproceedings | 2013 |
| 26 | | Raidl, Günther ; Hu, Bin ; Rainer-Harbach, Marian ; Papazek, Petrina | Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations | Konferenzbeitrag Inproceedings | 2013 |
| 27 | | Pop, Petrica ; Hu, Bin ; Raidl, Günther | A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem | Konferenzbeitrag Inproceedings | 2013 |
| 28 | | Hu, Bin ; Raidl, Günther | An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem | Konferenzbeitrag Inproceedings | 2012 |
| 29 | | Hu, Bin ; Raidl, Günther | An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem | Konferenzbeitrag Inproceedings | 2012 |
| 30 | | Raidl, Günther ; Causevic, Emir ; Hu, Bin ; Rainer-Harbach, Marian | Balancing Bicycle Sharing Systems by Variable Neighborhood Search | Präsentation Presentation | 2012 |
| 31 | | Hu, Bin ; Raidl, Günther | An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem | Konferenzbeitrag Inproceedings | 2011 |
| 32 | | Hu, Bin ; Leitner, Markus ; Raidl, Günther | The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search | Artikel Article | 2010 |
| 33 | | Pagacz, Anna ; Hu, Bin ; Raidl, Günther | A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem | Konferenzbeitrag Inproceedings | 2010 |
| 34 | | Raidl, Günther ; Hu, Bin | Enhancing genetic algorithms by a trie-based complete solution archive | Konferenzbeitrag Inproceedings | 2010 |
| 35 | | Hu, Bin ; Raidl, Günther | A memetic algorithm for the generalized minimum vertex-biconnected network problem | Konferenzbeitrag Inproceedings | 2009 |
| 36 | | Hu, Bin ; Leitner, Markus ; Raidl, Günther | Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem | Artikel Article | 2008 |
| 37 | | Hu, Bin ; Raidl, Günther | Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem | Konferenzbeitrag Inproceedings | 2008 |
| 38 | | Hu, Bin ; Raidl, Günther | Effective neighborhood structures for the generalized traveling salesman problem | Konferenzbeitrag Inproceedings | 2008 |
| 39 | | Hu, Bin | Hybrid metaheuristics for generalized network design problems | Thesis Hochschulschrift | 2008 |
| 40 | | Leitner, Markus ; Hu, Bin ; Raidl, Günther | Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem | Konferenzbeitrag Inproceedings | 2007 |