Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHa Bang Ban
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Nguyen Binh Long, Do Tuan Anh, Ha-Bang Ban, Huynh Thi Thanh Binh:
A multipopulation multitasking evolutionary scheme with adaptive knowledge transfer to solve the clustered minimum routing cost tree problem. Inf. Sci. 657: 119961 (2024)- 2023
- [j13]Minh Anh Nguyen, Hai Long Luong, Minh Hoàng Hà
, Ha-Bang Ban:
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem. 4OR 21(4): 609-637 (2023) - [j12]Ha-Bang Ban, Hai-Dang Pham:
Metaheuristic for Solving the Delivery Man Problem with Drone. Comput. Informatics 42(5): 1184-1212 (2023) - [j11]Ha-Bang Ban, Dang Hai Pham:
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm. PeerJ Comput. Sci. 9: e1192 (2023) - [c14]Cong Dao Tran, Anh Do Tuan, Huynh Thi Thanh Binh, Anh Do Duc, Ha Bang Ban, Su Nguyen Phan Bach:
MNDE: Node-depth encoding can do better in evolutionary multitask algorithms. GECCO Companion 2023: 251-254 - [c13]Tuan Anh Do, Quang Nghia Le, Thang Long Nguyen, Nguyen Quang Dich, Vu Hoang Phuong:
A new Interleaved Full-Bridge Converter for AC battery. ICCAIS 2023: 260-265 - 2022
- [j10]Ha-Bang Ban:
The hybridization of ACO + GA and RVNS algorithm for solving the time-dependent traveling salesman problem. Evol. Intell. 15(1): 309-328 (2022) - 2021
- [j9]Ha-Bang Ban, Dang Hai Pham:
Multifactorial Evolutionary Algorithm for Simultaneous Solution of TSP and TRP. Comput. Informatics 40(6) (2021) - [j8]Ha-Bang Ban:
Variable neighbourhood search-based algorithm to solve the minimum back-walk-free latency problem. Int. J. Comput. Appl. Technol. 65(1): 55-64 (2021) - [j7]Ha-Bang Ban:
Applying Metaheuristic for Time-Dependent Traveling Salesman Problem in Postdisaster. Int. J. Comput. Intell. Syst. 14(1): 1087-1107 (2021) - [j6]Ha Bang Ban:
A Metaheuristic for the Bounded Single-Depot Multiple Traveling Repairmen Problem. Informatica (Slovenia) 45(1) (2021) - [j5]Ha-Bang Ban:
A metaheuristic for the delivery man problem with time windows. J. Comb. Optim. 41(4): 794-816 (2021) - [j4]Faisal AlGashaam, Kien Nguyen, Jasmine Banks, Vinod Chandran, Tuan-Anh Do, Mohamed I. Alkanhal:
Hierarchical fusion network for periocular and iris by neural network approximation and sparse autoencoder. Mach. Vis. Appl. 32(1): 15 (2021) - [i1]Minh Anh Nguyen, Hai Long Luong, Minh Hoàng Hà, Ha-Bang Ban:
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem. CoRR abs/2111.11307 (2021)
2010 – 2019
- 2019
- [j3]Ha Bang Ban, Due Nghia Nguyen, Kien Nguyen:
An Effective Metaheuristic for Multiple Traveling Repairman Problem with Distance Constraints. Comput. Informatics 38(4): 883-916 (2019) - [j2]Ha Bang Ban:
An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem. RAIRO Oper. Res. 53(3): 917-935 (2019) - [c12]Ha Bang Ban:
A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows. CSoNet 2019: 63-69 - [c11]Ha Bang Ban, Nguyen Duc Nghia:
Metaheuristic for the Traveling Repairman Problem with Time Window Constraints. RIVF 2019: 1-6 - [c10]Ha-Bang Ban, Duc-Nghia Nguyen:
Using Metaheuristic for Solving the Resource-Constrained Deliveryman Problem. SoICT 2019: 63-68 - 2018
- [b1]Tuan Anh Do:
A quality-centered approach for web application engineering. (Une approche centrée sur la qualité pour l'ingénierie des applications Web). Conservatoire national des arts et métiers, Paris, France, 2018 - 2017
- [j1]Ha Bang Ban, Nguyen Duc Nghia:
A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem. Fundam. Informaticae 156(1): 21-41 (2017) - 2016
- [c9]Ha Bang Ban, Due Nghia Nguyen:
An effective GRASP+VND metaheuristic for the k-Minimum Latency Problem. RIVF 2016: 31-36 - 2014
- [c8]Ha Bang Ban, Nghia Nguyen Duc:
A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem. SoICT 2014: 39-48 - 2013
- [c7]Jen-Yung Lin, Bo-Kai Yang, Tuan Anh Do, Hsing-Chung (Jack) Chen:
The Accuracy Enhancement of GPS Track in Google Map. BWCCA 2013: 524-527 - [c6]Tai Nguyen Huu, Hoang-Lan Nguyen Thi, Ha Bang Ban:
Robust Adaptive Image Coding for Frame Memory Reduction in LCD Overdrive. DCC 2013: 497 - [c5]Jen-Yung Lin, Tuan Anh Do, Bo-Kai Yang, Yung-Fa Huang:
Design of refrigerated cargo tracking systems. iCAST/UMEDIA 2013: 400-406 - [c4]Ha Bang Ban, Nghia Nguyen Duc:
A Subgradient Method to Improve Approximation Ratio in the Minimum Latency Problem. KSE (1) 2013: 339-350 - [c3]Ha Bang Ban, Nghia Nguyen Duc:
A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem. RIVF 2013: 192-197 - 2012
- [c2]Ha Bang Ban, Nguyen Duc Nghia:
An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem. RIVF 2012: 1-4 - 2010
- [c1]Ha Bang Ban, Nguyen Duc Nghia:
Improved genetic algorithm for minimum latency problem. SoICT 2010: 9-15
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-04-25 05:57 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:
