Остановите войну!
for scientists:
default search action
Minh Hoàng Hà
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [e1]Minh Hoàng Hà, Xingquan Zhu, My T. Thai:
Computational Data and Social Networks - 12th International Conference, CSoNet 2023, Hanoi, Vietnam, December 11-13, 2023, Proceedings. Lecture Notes in Computer Science 14479, Springer 2024, ISBN 978-981-97-0668-6 [contents] - [i10]Hoang Giang Pham, Tien Thanh Dam, Ngan Ha Duong, Tien Mai, Minh Hoàng Hà:
Competitive Facility Location under Random Utilities and Routing Constraints. CoRR abs/2403.04264 (2024) - 2023
- [j17]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) - [j16]Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà, Vu Hoang Vuong Nguyen:
New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule. J. Comb. Optim. 46(1): 1 (2023) - [j15]Minh Anh Nguyen, Minh Hoàng Hà:
The Parallel Drone Scheduling Traveling Salesman Problem with Collective Drones. Transp. Sci. 57(4): 866-888 (2023) - [c9]Quang Anh Pham, Hoong Chuin Lau, Minh Hoàng Hà, Lam Vu:
An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem. ICAPS 2023: 343-351 - [c8]Minh Hai Nguyen, Nam Hoai Chu, Diep N. Nguyen, Dinh Thai Hoang, Minh Hoàng Hà, Eryk Dutkiewicz:
Optimal Privacy Preserving in Wireless Federated Learning Over Mobile Edge Computing. ICC 2023: 2000-2006 - 2022
- [j14]Minh Anh Nguyen, Dang Thi Huong Giang, Minh Hoàng Hà, Minh-Trien Pham:
The min-cost parallel drone scheduling vehicle routing problem. Eur. J. Oper. Res. 299(3): 910-930 (2022) - [j13]Minh Hoàng Hà, Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, André Langevin, Martin Trépanier:
Solving the clustered traveling salesman problem with -relaxed priority rule. Int. Trans. Oper. Res. 29(2): 837-853 (2022) - [j12]Lam Vu, Duy Manh Vu, Minh Hoàng Hà, Viet-Phuong Nguyen:
The two-echelon routing problem with truck and drones. Int. Trans. Oper. Res. 29(5): 2968-2994 (2022) - [c7]Quang Anh Pham, Minh Hoàng Hà, Duy Manh Vu, Huy Hoang Nguyen:
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations. ICAPS 2022: 297-306 - [i9]Hai M. Nguyen, Nam Hoai Chu, Diep N. Nguyen, Dinh Thai Hoang, Minh Hoàng Hà, Eryk Dutkiewicz:
Optimal Privacy Preserving in Wireless Federated Learning System over Mobile Edge Computing. CoRR abs/2211.07166 (2022) - 2021
- [j11]Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà:
The vehicle routing problem with relaxed priority rules. EURO J. Transp. Logist. 10: 100039 (2021) - [j10]Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham, Minh Hoàng Hà:
Arc Routing with Time-Dependent Travel Times and Paths. Transp. Sci. 55(3): 706-724 (2021) - [c6]Quoc Trung Dinh, Duc Dong Do, Minh Hoàng Hà:
Ants can solve the parallel drone scheduling traveling salesman problem. GECCO 2021: 14-21 - [i8]Minh Hoàng Hà, Dinh Quy Ta, Trung Thanh Nguyen:
Exact Algorithms for Scheduling Problems on Parallel Identical Machines with Conflict Jobs. CoRR abs/2102.06043 (2021) - [i7]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) - 2020
- [j9]Minh Hoàng Hà, Tat Dat Nguyen, Thinh Nguyen Duy, Hoang Giang Pham, Thuy Do, Louis-Martin Rousseau:
A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints. Comput. Oper. Res. 124: 105085 (2020) - [j8]Quang Minh Ha, Yves Deville, Pham Quang Dung, Minh Hoàng Hà:
A hybrid genetic algorithm for the traveling salesman problem with drone. J. Heuristics 26(2): 219-247 (2020) - [i6]Minh Hoàng Hà, Lam Vu, Duy Manh Vu:
The two-echelon routing problem with truck and drones. CoRR abs/2004.02275 (2020) - [i5]Thibaut Vidal, Rafael Martinelli, Tuan Anh Pham, Minh Hoàng Hà:
Arc Routing with Time-Dependent Travel Times and Paths. CoRR abs/2004.14473 (2020)
2010 – 2019
- 2019
- [j7]Quoc Trung Bui, Thibaut Vidal, Minh Hoàng Hà:
On three soft rectangle packing problems with guillotine constraints. J. Glob. Optim. 74(1): 45-62 (2019) - [c5]Minh Hai Nguyen, Minh Hoàng Hà, Dinh Thai Hoang, Diep N. Nguyen, Eryk Dutkiewicz, The-Trung Tran:
An Efficient Algorithm for the k-Dominating Set Problem on Very Large-Scale Networks (Extended Abstract). CSoNet 2019: 74-76 - [c4]Minh Hoàng Hà, Duy Manh Vu, Yakov Zinder, Trung Thanh:
On The Capacitated Scheduling Problem with Conflict Jobs. KSE 2019: 1-5 - [i4]Minh Hoàng Hà, Tat Dat Nguyen, Thinh Nguyen Duy, Hoang Giang Pham, Thuy Do, Louis-Martin Rousseau:
A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints. CoRR abs/1910.13513 (2019) - 2018
- [j6]Teobaldo Bulhões, Minh Hoàng Hà, Rafael Martinelli, Thibaut Vidal:
The vehicle routing problem with service level constraints. Eur. J. Oper. Res. 265(2): 544-558 (2018) - [i3]Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, Minh Hoàng Hà, André Langevin, Martin Trépanier:
Solving the clustered traveling salesman problem with d-relaxed priority rule. CoRR abs/1810.03981 (2018) - [i2]Quang Minh Ha, Yves Deville, Quang-Dung Pham, Minh Hoàng Hà:
A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone. CoRR abs/1812.09351 (2018) - 2017
- [j5]Tuan Anh Pham, Minh Hoàng Hà, Xuan Hoai Nguyen:
Solving the multi-vehicle multi-covering tour problem. Comput. Oper. Res. 88: 258-278 (2017) - [j4]Lu Chen, Boxiao Chen, Quoc Trung Bui, Minh Hoàng Hà:
Designing service sectors for daily maintenance operations in a road network. Int. J. Prod. Res. 55(8): 2251-2265 (2017) - 2016
- [c3]Van Son Nguyen, Quang-Dung Pham, Minh Hoàng Hà:
Improving the connectivity of a bus system: a case study of Ho Chi Minh city. SoICT 2016: 73-78 - 2015
- [c2]Minh Hoàng Hà, Claude-Guy Quimper, Louis-Martin Rousseau:
General Bounding Mechanism for Constraint Programs. CP 2015: 158-172 - [i1]Quang Minh Ha, Yves Deville, Quang-Dung Pham, Minh Hoàng Hà:
Heuristic methods for the Traveling Salesman Problem with Drone. CoRR abs/1509.08764 (2015) - 2014
- [j3]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Comput. Oper. Res. 43: 9-19 (2014) - [j2]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
Solving the close-enough arc routing problem. Networks 63(1): 107-118 (2014) - 2013
- [j1]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. Eur. J. Oper. Res. 226(2): 211-220 (2013) - 2012
- [c1]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. ICORES 2012: 233-238
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 01:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint