TS. Nguyễn Cảnh Nam

Giảng viên

Viện phó

Email: nam.nguyencanh@hust.edu.vn, namngc@gmail.com

Các môn học đã và đang giảng dạy

  1. Giải tích 1
  2. Giải tích 2
  3. Math I (cho ICT)
  4. Math III (cho ICT)
  5. Calculus II (cho CTTT)
  6. Toán rời rạc
  7. Tối ưu hóa tổ hợp

Hướng nghiên cứu

  1. Tối ưu toàn cục
  2. Tối ưu DC
  3. Tối ưu rời rạc
  4. Tối ưu đa mục tiêu

Bài báo khoa học (journal)

  1. Nguyen Canh Nam, Pham Thi Hoai (2017), A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks, Computers and Operations Research , pp 95-107, Vol 82, File đính kèm: A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks
  2. Canh Nam Nguyen, Thi Hoai Pham and Van Huy Tran (2015), DC programming and DCA Approach for Resoure Allocation Optimization in OFDMA/TDD Wireless Networks, “Advanced Computational Methods for Knowledge Engineering”, Advances in Intelligent Systems and Computing , AISC 358, pp. 49-57, Springer
  3. Nguyen Huu Thanh, Doan Van Tung, Ngo Quynh Thu, Nguyen Canh Nam and Kumbesan Sandrasegaran (2016), Joint Scheduling and Mapping in Support of Downlink Fairness and Spectral Efficiency in IEEE 802.16e OFDMA System, International Journal of Communication Systems, pp 2227–2248, Volume 29, Issue 15 (http://onlinelibrary.wiley.com/doi/10.1002/dac.3137/abstract)
  4. Nguyễn Thị Bạch Kim, Nguyễn Cảnh Nam, Lê Quang Thủy (2010), Thuật toán giải bài toán qui hoạch lồi hai mục tiêu trong không gian ảnh, Tạp chí ứng dụng Toán học (Vietnam Journal of Mathematical Applications), Tập VIII, số 1, trang 75-91
  5. Nguyen Canh Nam, Le Thi Hoai An and Pham Dinh Tao (2007), A Branch and Bound Algorithm based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity, Operations Research Proceedings 2006 (Selected Papers of the International Conference on Operations Research 2006, Karlsruhe, September 6--8), Karl-Heinz Waldmann, Ulrike M. Stocker editors, pp 515--520, ISBN: 978-3-540-69994-1, Springer
  6. Le Thi Hoai An, Pham Dinh Tao, Nguyen Canh Nam and Nguyen Van Thoai (2009), DC programming techniques for Solving a Class of Nonlinear Bilevel Programs, Journal of Global Optimization, 44, pp. 313-337
  7. Pham Dinh Tao, Nguyen Canh Nam and Le Thi Hoai An (2009), DC Programming and DCA for Globally Solving the Value-At-Risk, Computational Management Science, 6:4, pp. 477-501, Springer-Verlag
  8. Le Thi Hoai An, Pham Dinh Tao, Nguyen Canh Nam and Le Dung Muu (2010), Method for Optimizing over Efficient and Weakly Efficient the Sets of an Affine Fractional Vector Optimization Program, Optimization, 59:1, pp. 77-93
  9. Pham Dinh Tao, Nguyen Canh Nam and Le Thi Hoai An (2010), An Efficient Combined DCA and B&B using DC/SDP Relaxation for Globally Solving Binary Quadratic Programs, Journal of Global Optimization, Vol 4, Number 4, pp 595-632, DOI: 10.1007/s10898-009-9507-y
  10. Nguyen Thi Bach Kim, Nguyen Canh Nam and Le Quang Thuy (2013), An Outcome Space Algorithm for Minimizing the Product of Two Convex Functions over a Convex Set, Journal of Industrial and Management Optimization, Vol 9, Num 1, pp. 248-253

Báo cáo hội nghị (conference)

  1. N.C. Nam, T.A. Son and P.T. Hoai (2015), A New Branch and Bound Algorithm for Solving the Maximum Edge-Weighted Clique Problem, 6th International Conference on High Performance Scientific Computing . Modeling, Simulation and Optimization of Complex Processes, Hanoi - Viet Nam, March 16 - 20
  2. Canh Nam Nguyen, Thi Hoai Pham and Van Huy Tran (2015), DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Network, International Conference on Computer Science, Applied Mathematics and Applications - ICCSAM 2015, Metz - France, May 11-13, 49-56
  3. N. T. B. Kim , N. C. Nam , and L. Q. Thuy (2012), An Outcome Space Algorithm for Minimizing the Product of Two Convex Functions over a Convex Set, 5th International Conference on High Performance Scientific Computing, Ha Noi, Viet Nam, March 5-9, 2012
  4. Nguyen Thi Bach Kim, Nguyen Canh Nam and Le Quang Thuy (2010), An Algorithm for Solving the Bicriteria Convex Programming Problem in Outcome Space, Hội nghị toàn quốc về Toán ứng dụng lần thứ 3, Ha Noi, Viet Nam, December 23-25
  5. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2005), A Combination of DCA and SDP Techniques in a Branch and Bound Scheme for Globally Solving DC Programs, SIAM05 – 8th SIAM Conference on Optimization, Stockholm, Sweden, May 15-17
  6. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2006), DC Programming and DCA for Globally Solving the Value-at-Risk Problems, CMS 2006 – 3rd International Conference on Computational management Science, Amsterdam, Netherlands, May 17-19
  7. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2006), Diversity Data Mining: DC Programming and DCA, RSFS – 13th Société Francophone de Classification, Metz, France, September 6-8
  8. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2006), An algorithm combining DCA-B&B-SDP for binary quadratic programs, ROADEF06 - Conférence Scientifique en Aide à la décision, Lille, France, February 6-8
  9. Nguyen Canh Nam, Le Thi Hoai An and M. Ouanes (2007), A combined DCA and Branch-and-Bound using a new convex quadratic underestimation for globally solving box constrained quadratic programming, FRANCORO/ROADEF07 - Conférence Scientifique conjointe en Rechercher Opérationnelle et Aide à la décision, Grenoble, France, February 20-23
  10. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2007), DC Programming and DCA for Diversity Data Mining, FRANCORO/ROADEF07 - Conférence Scientifique conjointe en Rechercher Opérationnelle et Aide à la décision, Grenoble, France, February 20-23
  11. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2007), Quadratic Assignment Problem: DC programming approach and DCA, FRANCORO/ROADEF07 - Conférence Scientifique conjointe en Rechercher Opérationnelle et Aide à la décision, Grenoble, France, February 20-23
  12. Nguyen Canh Nam, Le Thi Hoai An, Pham Dinh Tao and Nguyen Van Thoai (2007), Nonlinear Bilevel Programming by DC Programming and DCA, CMS 2007 – 4th International Conference on Computational management Science, Geneva, Switzerland, April 20-22
  13. Nguyen Canh Nam, Le Thi Hoai An, Pham Dinh Tao and Le Dung Muu (2007), Methods for Optimizing over the Efficient and Weakly Efficient Sets of an Affine Fractional Vector Optimization Program, CMS 2007 – 4th International Conference on Computational management Science, Geneva, Switzerland, April 20-22
  14. N. Nguyen Canh, T. Pham Dinh and H.A. Le Thi (2007), A Combined DCA and Branch-and-Bound with New Bounding Techniques for Globally Solving Nonconvex Quadratic Programs, NCP07 – The International Conference on Nonconvex Programming : Local and Global Approaches.Theory, Algorithms and Applications, Rouen, France, December 17-21
  15. Nguyen Canh Nam, Pham Dinh Tao and Le Thi Hoai An (2008), DC programming and DCA for Standard Quadratic Programs, CMS 2008 – 5th International Conference on Computational Management Science, London, England, March 26-28
  16. M. Stolpe, N. Nguyen Canh and R. Stainko (2008), The Branch and Cut Method in the PLATO-N Project, EngOpt 2008 – International Conference on Engineering Optimization, Rio de Janeiro, Brazil, June 1-5
  17. Dung T. Tran, Aristotelis Pagoulatos, Carl H. Sondergeld, Nam Nguyen Canh and Jean-Claude Roegiers (2010), Quantify Uncertainty of Rock Failure Parameters from Laboratory Trixial Testing using Conventional Multistage Approaches, The 44th U.S. Rock Mechanics Symposium and 5th U.S.-Canada Symposium ARMA, USA, 250-263

Đề tài khoa học

  1. Về một bài toán tối ưu trong thiết kế mạng di động thế hệ mới. Mã đề tài: T2012-207. Loại đề tài: Đề tài cấp trường. Vai trò: Chủ nhiệm. Năm bắt đầu: 2012. Năm kết thúc: 2012
  2. Bài toán quy hoạch toàn phương với biến nguyên và ứng dụng. Thuật toán và thử nghiệm số. Mã đề tài: T2011-110. Loại đề tài: Đề tài cấp trường. Vai trò: Chủ nhiệm. Năm bắt đầu: 2011. Năm kết thúc: 2011
  3. Tiếp cận địa phương va tiếp cận toàn cục giải một số lớp bài toán tối ưu không lồi. Mã đề tài: 101.01-2013.19. Loại đề tài: Đề tài Nafosted. Vai trò: Chủ nhiệm. Năm bắt đầu: 2014. Năm kết thúc: 2016