default search action
Bin Hu 0004
Person information
- affiliation: AIT Austrian Institute of Technology, Vienna, Austria
- affiliation: Vienna University of Technology, Institute of Computer Graphics and Algorithms, Austria
Other persons with the same name
- Bin Hu — disambiguation page
- Bin Hu 0001
— Beijing Institute of Technology, School of Medical Technology, China (and 4 more)
- Bin Hu 0002
— University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, Coordinated Science Laboratory, Champaign, IL, USA (and 2 more)
- Bin Hu 0003
— Harbin Institute of Technology, Research Institute of Electronic Engineering Technology, China (and 1 more)
- Bin Hu 0006
— Huazhong University of Science and Technology, School of Management, Wuhan, China
- Bin Hu 0007
— National Institute of Standards and Technology, US Department of Commerce, Gaithersburg, MD, USA (and 1 more)
- Bin Hu 0008
— Huazhong University of Science and Technology, College of Automation, Wuhan, China
- Bin Hu 0009
— University of Texas at Dallas, Department of Information Systems and Operations Management, TX, USA
- Bin Hu 0010 — Chinese Academy of Sciences, Institute of Automation, State Key Laboratory of Management and Control for Complex Systems, Beijing, China (and 2 more)
- Bin Hu 0011 — PLA SSF Information Engineering University, Zhengzhou, China
- Bin Hu 0012
— Harbin Institute of Technology, School of Electronics and Information Engineering, Key Laboratory of Marine Environmental Monitoring and Information Processing, China
- Bin Hu 0013
— Northwestern Polytechnical University, School of Electronics and Information, Xi'an, China
- Bin Hu 0014
— University of Houston, Cullen College of Engineering, Houston, TX, USA (and 3 more)
- Bin Hu 0015
— Jilin University, College of Geo-Exploration Science and Technology, Changchun, China
- Bin Hu 0016
— Kean University, Department of Computer Science and Technology, Union, NJ, USA (and 1 more)
- Bin Hu 0017
— Nanjing Normal University, College of Geographic Science, China
- Bin Hu 0018
— Shanghai University of Engineering Science, School of Management, China (and 1 more)
- Bin Hu 0019
— Wuhan University of Science and Technology, School of Resource and Environmental Engineering, China (and 1 more)
- Bin Hu 0020
— Northwestern Polytechnical University, School of Automation, Xi'an, China
- Bin Hu 0021
— Central South University, School of Computer Science, Changsha, China
- Bin Hu 0022
— Nanjing Agriculture University, College on Information Science & Technology, China
- Bin Hu 0023
— Nantong University, School of Information Science and Technology, Jiangsu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Martin Reinthaler, Bin Hu
, Hannes Watzinger, Christoph Feichtinger, Matthias Neubauer, Wolfgang Schildorfer:
Integration von hybriden automatisierten Flotten in Österreich. Elektrotech. Informationstechnik 141(6): 369-374 (2024) - [j10]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) - 2022
- [c25]Ulrike Ritzinger
, Hannes Koller
, Bin Hu
:
Multi-day Container Drayage Problem with Active and Passive Vehicles. EUROCAST 2022: 96-103
2010 – 2019
- 2019
- [c24]Bin Hu, Clovis Seragiotto, Matthias Prandtstetter
, Benjamin Binder, Markus Bader:
Guiding Autonomous Vehicles Past Obstacles - Theory and Practice. EUROCAST (1) 2019: 271-278 - [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
- [j9]Bin Hu, Francisco Chicano
:
Editorial for the special issue on metaheuristics for combinatorial optimization. J. Heuristics 24(3): 239-242 (2018) - [j8]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) - [c23]Sarah Pfoser
, Thomas Berger
, Georg Hauger, Claudia Berkowitsch, Reinhold Schodl, Sandra Eitler, Karin Markvica, Bin Hu
, Jürgen Zajicek, Matthias Prandtstetter
:
Integrating High-Performance Transport Modes into Synchromodal Transport Networks. LDIC 2018: 109-115 - 2017
- [c22]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 - [c21]Benjamin Biesinger, Bin Hu, Martin Stubenschrott, Ulrike Ritzinger, Matthias Prandtstetter
:
Optimizing Charging Station Locations for Electric Car-Sharing Systems. EvoCOP 2017: 157-172 - 2016
- [j7]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) - [j6]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) - [e1]Francisco Chicano
, Bin Hu, Pablo García-Sánchez
:
Evolutionary Computation in Combinatorial Optimization - 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 - April 1, 2016, Proceedings. Lecture Notes in Computer Science 9595, Springer 2016, ISBN 978-3-319-30697-1 [contents] - 2015
- [j5]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) - [j4]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) - [j3]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) - [c20]Christoph Weiler, Benjamin Biesinger, Bin Hu
, Günther R. Raidl:
Heuristic Approaches for the Probabilistic Traveling Salesman Problem. EUROCAST 2015: 342-349 - [c19]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 - [c18]Bin Hu, Andreas Windbichler, Günther R. Raidl:
A New Solution Representation for the Firefighter Problem. EvoCOP 2015: 25-35 - [c17]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
- [c16]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 - [c15]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 - [c14]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 - [c13]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
- [c12]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 - [c11]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 - [c10]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 - [c9]Marian Rainer-Harbach, Petrina Papazek, Bin Hu
, Günther R. Raidl:
Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach. EvoCOP 2013: 121-132 - [c8]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
- [c7]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
- [c6]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
- [j2]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) - [c5]Günther R. Raidl, Bin Hu:
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive. EvoCOP 2010: 239-251 - [c4]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
2000 – 2009
- 2009
- [c3]Bin Hu, Günther R. Raidl:
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. HIS (3) 2009: 63-68 - 2008
- [j1]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) - [c2]Bin Hu
, Günther R. Raidl:
Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. EvoCOP 2008: 36-47 - [c1]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
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 2025-02-08 00:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint