default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBui Quoc Trung
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j7]Van Son Nguyen, Quang Dung Pham, Quoc Trung Bui, Thuy Chau Tran:
A proposed local search strategy and neighborhoods for solving a new variant of e-commerce districting problem. Comput. Ind. Eng. 213: 111843 (2026)- [j6]Quoc-Trung Bui:
Dynamic programming for the exact pareto front in multi-objective discretization of imbalanced datasets. Inf. Sci. 741: 123292 (2026) - [c15]Bui Quoc Trung, Pham Quang Dung:
New Mixed-Integer Linear Programming Formulations with Redundant Variables for Elementary Shortest Path and Quorumcast Routing Problems. ACIIDS (2) 2026: 34-45 - [c14]Quoc-Trung Bui, Duy-Vu Nguyen, Van-Son Nguyen, Quang-Dung Pham:
Solving Soft-Rectangle Packing with Guillotine Constraints for Field Allocation in Vietnamese Agriculture. ACIIDS (Companion 2) 2026: 93-108 - 2024
- [c13]Bui Quoc Trung, Vuong Hoang Minh, Nguyen Thi Hoai Linh, Bui Thi Mai Anh:
A Novel Dynamic Programming Method for Non-parametric Data Discretization. ACIIDS (1) 2024: 215-227 - [c12]Thi-Mai-Anh Bui
, Van-Tri Do, Minh Vu Le, Quoc-Trung Bui:
Dynamic Difficulty Coefficient in Search-Based Software Testing: Targeting to Hard Branch Coverage. GECCO Companion 2024: 711-714 - 2023
- [c11]Bui Quoc Trung, Duong Viet Anh, Bui Thi Mai Anh:
A Novel Meta-heuristic Search Based on Mutual Information for Filter-Based Feature Selection. ACIIDS (1) 2023: 395-407 - [c10]Thi-Mai-Anh Bui, Quoc-Trung Bui, Van-Tri Do:
A Novel Fitness Function for Automated Software Test Case Generation Based on Nested Constraint Hardness. GECCO Companion 2023: 791-794 - [c9]Bui Quoc Trung, Thi-Mai-Anh Bui, Nguyen Viet Chinh, Pham Quang Dung, Nguyen Manh Cuong:
Metaheuristic for a soft-rectangle packing problem with guillotine constraints. SoICT 2023: 715-722 - 2022
- [j5]Van Son Nguyen, Quang Dung Pham, Thanh Hoang Nguyen, Quoc Trung Bui:
Modeling and solving a multi-trip multi-distribution center vehicle routing problem with lower-bound capacity constraints. Comput. Ind. Eng. 172(Part): 108597 (2022) - [c8]Bui Quoc Trung, Le Minh Duc, Bui Thi Mai Anh:
A Hybrid Approach Based on Genetic Algorithm with Ranking Aggregation for Feature Selection. IEA/AIE 2022: 226-239 - [c7]Bui Thi Mai Anh, Duong Viet Anh, Bui Quoc Trung:
A Filter Approach Based on Binary Integer Programming for Feature Selection. RIVF 2022: 677-682 - [c6]Bui Quoc Trung, Tran Van Tri, Bui Thi Mai Anh:
Empirical Analysis of Filter Feature Selection Criteria on Financial Datasets. SoICT 2022: 413-419
2010 – 2019
- 2019
- [j4]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]Tien Thanh Dam, Duy Thinh Nguyen, Quoc Trung Bui, Trung Kien Do:
On the Traveling Salesman Problem with Hierarchical Objective Function. KSE 2019: 1-5 - 2017
- [j3]Quang-Dung Pham, Kim Thu Le, Nguyen Thanh Hoang, Van Dinh Pham, Quoc Trung Bui:
A Constraint-Based Local Search for Offline and Online General Vehicle Routing. Int. J. Artif. Intell. Tools 26(2): 1750004:1-1750004:32 (2017) - [j2]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
- [j1]Quoc Trung Bui, Yves Deville, Quang-Dung Pham:
Exact methods for solving the elementary shortest and longest path problems. Ann. Oper. Res. 244(2): 313-348 (2016) - [c4]Tran Khanh Hiep, Nguyen Minh Duc, Quoc Trung Bui:
Local search approach for the pairwise constrained clustering problem. SoICT 2016: 115-122 - 2015
- [b1]Quoc Trung Bui:
Modelling and solving complex combinatorial optimization problems: quorumcast routing, elementary shortest path, elementary longest path and agricultural land allocation. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2015 - 2014
- [c3]Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Solving the Quorumcast Routing Problem as a Mixed Integer Program. CPAIOR 2014: 45-54 - 2013
- [c2]Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search. CP 2013: 749-757 - 2011
- [c1]Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Constraint-based local search for fields partitioning problem. SoICT 2011: 19-28
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 2026-06-27 06:31 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
