default search action
Benjamin Biesinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Sinziana I. Rasca, Bin Hu, Benjamin Biesinger, Matthias Prandtstetter:
Agent-based decision-support model for bus route redesign in networks of small cities and towns: case study of Agder, Norway. Public Transp. 16(2): 583-618 (2024) - [c8]Thomas Sautter, Shaun West, Benjamin Biesinger, Daryl Powell:
Transforming a New-Build Factory into a Service Operations Workshop: A PDCA Approach to Change Management in Industrial Servitization. APMS (5) 2024: 229-244 - 2021
- [j5]Sebastian Knopp, Benjamin Biesinger, Matthias Prandtstetter:
Mobility offer allocations in corporate settings. EURO J. Comput. Optim. 9: 100010 (2021)
2010 – 2019
- 2019
- [p1]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
- [j4]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) - [i1]Sebastian Knopp, Benjamin Biesinger, Matthias Prandtstetter:
A Resource Allocation based Approach for Corporate Mobility as a Service. CoRR abs/1810.05659 (2018) - 2017
- [c7]Benjamin Biesinger, Bin Hu, Martin Stubenschrott, Ulrike Ritzinger, Matthias Prandtstetter:
Station Planning by Simulating User Behavior for Electric Car-Sharing Systems. EUROCAST (1) 2017: 275-282 - [c6]Benjamin Biesinger, Bin Hu, Martin Stubenschrott, Ulrike Ritzinger, Matthias Prandtstetter:
Optimizing Charging Station Locations for Electric Car-Sharing Systems. EvoCOP 2017: 157-172 - 2016
- [j3]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) - [j2]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) - [c5]Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl:
Districting and Routing for Security Control. HM 2016: 87-103 - 2015
- [j1]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) - [c4]Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl:
Heuristic Approaches for the Probabilistic Traveling Salesman Problem. EUROCAST 2015: 342-349 - [c3]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
- [c2]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 - 2013
- [c1]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
Coauthor Index
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-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint