dungpq

TS. Phạm Quang Dũng

Giảng viên
Họ và tên TS. Phạm Quang Dũng
Địa chỉ nơi làm việc Phòng 602 nhà B1, Viện Công nghệ Thông tin và Truyền thông, trường ĐHBK Hà Nội
Email  dungpq@soict.hust.edu.vn

dung.phamquang@hust.edu.vn

Tel  (84-4) 3 8696121
Fax  (84-4) 3 8692906
Các môn giảng dạy -Toán rời rạc

-Cấu trúc dữ liệu và giải thuật

– Lập trình song song

– Phân tích và thiết kế thuật toán

– Tìm kiếm cục bộ dựa trên ràng buộc

Hướng nghiên cứu –          Tối ưu thỏa mãn ràng buộc với các hướng tiếp cận: quy hoạch ràng buộc, tìm kiếm cục bộ và quy hoạch nguyên tuyến tính

–          Các bài toán NP-khó trên đồ thị

Các công trình NC đã công bố

 

1.  Q.T. Bui, Q.D. Pham, Y. Deville. Solving the Quorumcast Routing Problem as a Mixed Integer Program11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014), Cork, Ireland, May 2014, Lecture Notes in Computer Science, Springer, 2014.

2.      Q.T. Bui, Q.P. Dung, Y. Deville. Solving the Agricultural Land Allocation Problem by Constraint-Based Local Search, 19th International Conference on Principles and Practice of Constraint Programming (CP 2013), Uppsala, Sweden, October 2013. Lecture Notes in Computer Science, Springer, 2013.

3.      Q.D. Pham, Y. Deville, P. Van Hentenryck. LS(Graph): a Constraint-Based Local Search for Constraint Optimization on Trees and Paths. Journal of Constraints, Volume 17, Number 4 (2012), 357-408, DOI: 10.1007/s10601-012-9124-0 (SpringerLink).

4.      Q.D. Pham, Y. Deville. Solving the Quorumcast Routing Problem by Constraint Programming. Journal of Constraints, Volume 17, Number 4 (2012), 409-431, DOI: 10.1007/s10601-012-9125-z (SpringerLink).

5.      Pham Quang Dung, Yves Deville. Solving the Longest Simple Path Problem by Constraint-Based Techniques. 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2012), Lecture Notes in Computer Science, Springer, pp 292-306, 2012.

6.      Quoc Trung Bui, Quang Dung Pham and Yves Deville. Constraint-Based Local Search for Fields Partitioning Problem. 2nd International Symposium on Information and Communication Technology – SoICT 2011, pages 19-25, 2011.

7.      Phan Thuan Do, Thai Duong Nguyen and Quang Dung Pham. An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint. 2nd International Symposium on Information and Communication Technology – SoICT 2011, pages 29-35, 2011.

8.      Pham Quang Dung, Phan-Thuan Do, Y. Deville, Tuong-Vinh Ho. Constraint-based local search for solving non-simple paths problems on graphs: Application to the Routing for Network Covering Problems, In Proceedings of Symposium on Information and Communication Technology, SoICT2010, Hanoi, Vietnam, pages 1-8, 2010.

9.      Pham Quang Dung, Y. Deville, P. Van Hentenryck. Constraint-Based Local Search for Constrained Optimum Paths Problems, 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), pp 267-281, Lecture Notes in Computer Science, Springer, 2010.

10.  V.T. Ho, P. Francois, Y. Deville, D.Q. Pham, O. Bonaventure Using Local Search for Traffic Engineering in Switched Ethernet Networks, Proceedings of 22nd International Teletraffic Congress (ITC-22) September 2010, pp 1-8, Amsterdam, Netherlands

11.  Pham Quang Dung, Y. Deville, P. Van Hentenryck. LS(Graph): A Local Search Framework for Constraint Optimization on Graphs and Trees.  Proceedings of the 2009 ACM Symposium on Applied Computing (SAC’09), pp 1402-1407, March 8-12, 2009.

Các sách đã xuất bản Không có
Học viên cao học đang hướng dẫn Không có
Nghiên cứu sinh đang hướng dẫn Không có
Các thông tin khác (nếu có) Không có