Остановите войну!
for scientists:
default search action
Günther R. Raidl
- > Home > Persons > Günther R. Raidl
Publications
- 2019
- [p5]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Memetic Algorithm for Competitive Facility Location Problems. Business and Consumer Analytics: New Ideas 2019: 637-660 - 2018
- [j35]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands. Transp. Sci. 52(3): 673-690 (2018) - 2016
- [j32]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Models and algorithms for competitive facility location problems with different customer behavior. Ann. Math. Artif. Intell. 76(1-2): 93-119 (2016) - [j30]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. Electron. Notes Discret. Math. 52: 245-252 (2016) - 2015
- [j23]Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search. Electron. Notes Discret. Math. 47: 149-156 (2015) - [j21]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. J. Heuristics 21(3): 391-431 (2015) - [j20]Marian Rainer-Harbach, Petrina Papazek, Günther R. Raidl, Bin Hu, Christian Kloimüllner:
PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. J. Glob. Optim. 63(3): 597-629 (2015) - [c100]Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Heuristic Approaches for the Probabilistic Traveling Salesman Problem. EUROCAST 2015: 342-349 - [c96]Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl:
A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. EUROCAST 2015: 439-446 - [c95]Bin Hu, Andreas Windbichler, Günther R. Raidl:
A New Solution Representation for the Firefighter Problem. EvoCOP 2015: 25-35 - [c94]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. EvoCOP 2015: 48-60 - 2014
- [c89]Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. EvoCOP 2014: 73-84 - [c86]Günther R. Raidl, Thomas Baumhauer, Bin Hu:
Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. Hybrid Metaheuristics 2014: 183-197 - [c85]Benjamin Biesinger, Bin Hu, Günther R. Raidl:
An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. LION 2014: 203-217 - [c84]Petrina Papazek, Christian Kloimüllner, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid. PPSN 2014: 792-801 - 2013
- [c82]Petrica C. Pop, Bin Hu, Günther R. Raidl:
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. EUROCAST (1) 2013: 219-226 - [c81]Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu:
A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. EUROCAST (1) 2013: 372-379 - [c80]Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl:
Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. EUROCAST (1) 2013: 380-387 - [c79]Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl:
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP 2013: 121-132 - [c77]Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek:
Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations. Hybrid Metaheuristics 2013: 130-143 - 2012
- [c71]Bin Hu, Günther R. Raidl:
An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. GECCO 2012: 393-400 - 2011
- [c66]Bin Hu, Günther R. Raidl:
An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem. EUROCAST (1) 2011: 287-294 - 2010
- [j12]Bin Hu, Markus Leitner, Günther R. Raidl:
The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks 55(3): 256-275 (2010) - [c56]Günther R. Raidl, Bin Hu:
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. EvoCOP 2010: 239-251 - [c51]Anna Pagacz, Bin Hu, Günther R. Raidl:
A Memetic Algorithm with Population Management for the Generalized Minimum Vertex-Biconnected Network Problem. INCoS 2010: 356-361 - 2009
- [c42]Bin Hu, Günther R. Raidl:
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. HIS (3) 2009: 63-68 - 2008
- [j8]Bin Hu, Markus Leitner, Günther R. Raidl:
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics 14(5): 473-499 (2008) - [c39]Bin Hu, Günther R. Raidl:
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP 2008: 36-47 - [c37]Bin Hu, Günther R. Raidl:
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. HIS 2008: 73-77
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint