default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanyu Gu
Person information
- affiliation: University of Technology Sydney, Australia
- affiliation: Shanghai Jiao Tong University, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Alireza Etminaniesfahani
, Hanyu Gu, Leila Moslemi Naeni, Amir Salehipour:
An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem. Ann. Oper. Res. 338(1): 41-68 (2024)- [c15]Alireza Etminaniesfahani, Hanyu Gu, Leila Moslemi Naeni, Amir Salehipour:
An Efficient Approximate Dynamic Programming Approach for Resource-Constrained Project Scheduling with Uncertain Task Duration. ICORES 2024: 261-268 - [i1]Junfei Yi, Jianxu Mao, Tengfei Liu, Mingjie Li, Hanyu Gu, Hui Zhang, Xiaojun Chang, Yaonan Wang:
Teaching with Uncertainty: Unleashing the Potential of Knowledge Distillation in Object Detection. CoRR abs/2406.06999 (2024) - 2023
- [j17]Mobina Mashkani, Andreas T. Ernst, Dhananjay R. Thiruvady, Hanyu Gu:
Minimizing patients total clinical condition deterioration in operating theatre departments. Ann. Oper. Res. 328(1): 821-857 (2023) - [j16]Hanyu Gu, Hue Chi Lam, Thi Thanh Thu Pham, Yakov Zinder:
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem. J. Heuristics 29(1): 139-175 (2023) - [j15]Alireza Etminaniesfahani, Hanyu Gu, Leila Moslemi Naeni, Amir Salehipour:
A Forward-Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem. SN Comput. Sci. 4(2): 104 (2023) - 2022
- [j14]Hanyu Gu, Yefei Zhang, Yakov Zinder:
An efficient optimisation procedure for the Workforce Scheduling and Routing Problem: Lagrangian relaxation and iterated local search. Comput. Oper. Res. 144: 105829 (2022) - [j13]Hanyu Gu, Hue Chi Lam, Yakov Zinder:
A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty. EURO J. Comput. Optim. 10: 100050 (2022) - [j12]Alireza Etminaniesfahani, Hanyu Gu, Amir Salehipour:
ABFIA: A hybrid algorithm based on artificial bee colony and Fibonacci indicator algorithm. J. Comput. Sci. 61: 101651 (2022) - [c14]Alireza Etminaniesfahani, Hanyu Gu, Amir Salehipour:
An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem. ICORES 2022: 271-277 - 2021
- [c13]Hanyu Gu, Alireza Etminaniesfahani, Amir Salehipour:
A Bayesian Optimisation Approach for Multidimensional Knapsack Problem. OLA 2021: 86-97 - [c12]Hanyu Gu, Lucy MacMillan, Yefei Zhang, Yakov Zinder:
Iterated Local Search with Neighbourhood Reduction for the Pickups and Deliveries Problem Arising in Retail Industry. OLA 2021: 190-202 - 2020
- [c11]Mobina Mashkani, Hanyu Gu, Dhananjay R. Thiruvady, Andreas T. Ernst:
Minimizing Total Clinical Deterioration in Operating Theatres. SSCI 2020: 2373-2380 - [c10]Hanyu Gu:
Optimal Lagrangian Multipliers for the Multidimensional Knapsack Problem: a Bayesian Optimisation Approach. SSCI 2020: 3149-3155
2010 – 2019
- 2019
- [c9]Hanyu Gu, Hue Chi Lam:
A Genetic Algorithm Approach for Scheduling Trains Maintenance Under Uncertainty. ICCSAMA 2019: 106-118 - [c8]Hanyu Gu, Yefei Zhang, Yakov Zinder:
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem. SEA² 2019: 527-540 - 2018
- [j11]Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
Planning personnel retraining: column generation heuristics. J. Comb. Optim. 36(3): 896-915 (2018) - [j10]Hanyu Gu, Alexander V. Kononov, Julia Memar, Yakov Zinder:
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements. J. Discrete Algorithms 52-53: 143-155 (2018) - [j9]Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem. Theor. Comput. Sci. 718: 24-36 (2018) - [c7]Hanyu Gu, Julia Memar, Yakov Zinder:
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach. WALCOM 2018: 119-131 - 2017
- [j8]Oliver G. Czibula, Hanyu Gu, Aaron Russell, Yakov Zinder:
A multi-stage IP-based heuristic for class timetabling and trainer rostering. Ann. Oper. Res. 252(2): 305-333 (2017) - [c6]Hanyu Gu, Julia Memar, Yakov Zinder:
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements. IWOCA 2017: 312-324 - 2016
- [j7]Oliver G. Czibula, Hanyu Gu, Feng-Jang Hwang, Mikhail Y. Kovalyov, Yakov Zinder:
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom. Comput. Oper. Res. 65: 53-63 (2016) - [j6]Hanyu Gu:
Improving problem reduction for 0-1 Multidimensional Knapsack Problems with valid inequalities. Comput. Oper. Res. 71: 82-89 (2016) - [c5]Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
Scheduling Personnel Retraining: Column Generation Heuristics. ISCO 2016: 213-224 - [c4]Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems. WALCOM 2016: 327-338 - 2014
- [j5]Dhananjay R. Thiruvady, Mark Wallace, Hanyu Gu, Andreas Schutt:
A Lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows. J. Heuristics 20(6): 643-676 (2014) - 2013
- [c3]Hanyu Gu, Andreas Schutt, Peter J. Stuckey:
A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects. CPAIOR 2013: 340-346 - 2012
- [c2]Hanyu Gu, Peter J. Stuckey, Mark G. Wallace:
Maximising the Net Present Value of Large Resource-Constrained Projects. CP 2012: 767-781
2000 – 2009
- 2008
- [j4]Han-Yu Gu:
Computation of approximate alpha-points for large scale single machine scheduling problem. Comput. Oper. Res. 35(10): 3262-3275 (2008) - 2007
- [j3]Hong-Yuan Zhang, Han-Yu Gu, Yugeng Xi:
A Benders decomposition algorithm for base station planning problem in WCDMA networks. Comput. Oper. Res. 34(6): 1674-1687 (2007) - [j2]Hong-Yuan Zhang, Yugeng Xi, Han-Yu Gu:
A rolling window optimization method for large-scale WCDMA base stations planning problem. Eur. J. Oper. Res. 183(1): 370-383 (2007) - [c1]Hanyu Gu, Yugeng Xi, Jiping Tao:
Randomized Lagrangian heuristic based on Nash equilibrium for large scale single machine scheduling problem. ISIC 2007: 464-468 - 2005
- [j1]Bing Wang, Yugeng Xi, Hanyu Gu:
Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem. Comput. Oper. Res. 32: 3059-3072 (2005)
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-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
