


default search action
Pham Quang Dung
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c23]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
- [c22]Thai Nguyen, Trong-Hop Do, Quang-Dung Pham:
A Deep Learning based System for Covid-19 Positive Cases Detection Using Chest X-ray Images. ICTC 2022: 1082-1087 - 2021
- [j7]Quang-Dung Pham
, Nhu-Ngoc Dao
, Thuy Nguyen-Thanh, Sungrae Cho
, Hai Chien Pham
:
Detachable Web-Based Learning Framework to Overcome Immature ICT Infrastructure Toward Smart Education. IEEE Access 9: 34951-34961 (2021) - [c21]Trong-Hop Do, Dang-Khoa Tran, Dinh-Quang Hoang, Minh Quan Pham
, Quang-Dung Pham
, Nhu-Ngoc Dao
, Chunghyun Lee, Sungrae Cho
:
Night-Time Vehicle Distance Estimation Using Camera Geometry and Deep Learning. ICOIN 2021: 853-857 - [c20]Quang-Dung Pham
, Trong-Hop Do, Nhu-Ngoc Dao
, Woongsoo Na, Chunghyun Lee, Sungrae Cho
:
A Feasible Study of Cube Sensing Organization Map for Cognitive Spectrum Allocation. ICOIN 2021: 858-863 - 2020
- [j6]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)
2010 – 2019
- 2019
- [c19]Van Son Nguyen
, Pham Quang Dung:
A New Variant of Truck Scheduling for Transporting Container Problem. SoICT 2019: 139-146 - 2018
- [j5]Phan-Thuan Do, Nguyen-Viet-Dung Nghiem, Ngoc-Quang Nguyen, Quang-Dung Pham:
A time-dependent model with speed windows for share-a-ride problems: A case study for Tokyo transportation. Data Knowl. Eng. 114: 67-85 (2018) - [c18]Phan Anh Tu, Nguyen Tuan Dat, Pham Quang Dung:
Traveling Salesman Problem with Multiple Drones. SoICT 2018: 46-53 - [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
- [j4]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) - [c17]Van Son Nguyen
, Behrouz Babaki
, Anton Dries
, Pham Quang Dung, Nguyen Xuan:
Prediction-based optimization for online People and Parcels share a ride taxis. KSE 2017: 42-47 - 2016
- [j3]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) - [c16]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
- [c15]Pham Quang Dung, Thanh Trung Huynh
, Ta Duy Hoang, Nguyen Thanh Hoang:
A Java library for Constraint-Based Local Search: Application to the master thesis defense timetabling problem. SoICT 2015: 67-74 - [c14]Nguyen Van Hoai, Luu Thanh Cong, Pham Quang Dung:
Solving the TimeTabling problem at FPT University. SoICT 2015: 98-104 - [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
- [c13]Quoc Trung Bui, Quang-Dung Pham, Yves Deville
:
Solving the Quorumcast Routing Problem as a Mixed Integer Program. CPAIOR 2014: 45-54 - 2013
- [c12]Quoc Trung Bui, Quang-Dung Pham, Yves Deville
:
Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search. CP 2013: 749-757 - 2012
- [j2]Quang-Dung Pham, Yves Deville
, Pascal Van Hentenryck:
LS(Graph): a constraint-based local search for constraint optimization on trees and paths. Constraints An Int. J. 17(4): 357-408 (2012) - [j1]Quang-Dung Pham, Yves Deville
:
Solving the quorumcast routing problem by constraint programming. Constraints An Int. J. 17(4): 409-431 (2012) - [c11]Quang-Dung Pham, Yves Deville
:
Solving the Longest Simple Path Problem with Constraint-Based Techniques. CPAIOR 2012: 292-306 - [c10]Thi Thanh Binh Huynh, Quang-Dung Pham, Duy Dat Pham:
Genetic Algorithm for Solving the Master Thesis Timetabling Problem with Multiple Objectives. TAAI 2012: 74-79 - [c9]Pham Quang Dung, Adina Magda Florea
:
A literature-based method to automatically detect learning styles in learning management systems. WIMS 2012: 46:1-46:7 - 2011
- [b1]Pham Quang Dung:
LS(Graph): a constraint-based local search framework for constrained optimum tree and path problems on graphs. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2011 - [c8]Pham Quang Dung, Adina Magda Florea
:
An Architecture and a Domain Ontology for Personalized Multi-agent e-Learning Systems. KSE 2011: 181-185 - [c7]Quoc Trung Bui, Quang-Dung Pham, Yves Deville:
Constraint-based local search for fields partitioning problem. SoICT 2011: 19-28 - [c6]Phan-Thuan Do, Thai-Duong Nguyen, Quang-Dung Pham:
An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint. SoICT 2011: 29-35 - 2010
- [c5]Pham Quang Dung, Yves Deville, Pascal Van Hentenryck:
Constraint-Based Local Search for Constrained Optimum Paths Problems. CPAIOR 2010: 267-281 - [c4]Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuong-Vinh Ho
:
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering problem. SoICT 2010: 1-8 - [c3]Ho Trong Viet, Olivier Bonaventure, Yves Deville, Pham Quang Dung, Pierre François:
Using local search for traffic engineering in switched Ethernet networks. ITC 2010: 1-8
2000 – 2009
- 2009
- [c2]Pham Quang Dung, Yves Deville, Pascal Van Hentenryck:
LS(graph & tree): a local search framework for constraint optimization on graphs and trees. SAC 2009: 1402-1407 - [c1]Pham Quang Dung, Yves Deville, Pascal Van Hentenryck:
A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract). LSCS 2009: 5-11
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-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint