校際選修

115-1 選課時程

進行中

  • 初選第一階段 6/15/2026
  • 初選第二階段 6/22/2026
  • 校際選修 8/24/2026
  • 初選第三階段 8/31/2026
  • 開學後加退選 9/7/2026
  • 逾期加退選 9/21/2026
選課資源

高等演算法

Advanced Computer Algorithms

學期
112-1
學分
3 學分
當期課號
537608
永久課號
MGIM30048
開課單位
資訊管理研究所
授課教師
林妙聰
校區
光復
類別
選修
上課時間表
週二
2
09:00–09:50
高等演算法
MB312
3 節連堂
3
10:10–11:00
4
11:10–12:00

* 根據陽明交大上課時間表所列

概述

The theme is to prepare the participants with fundamentals of combinatorial optimization and solution approaches for solving optimization problems. Through theoretical studies as well as computer implementation, we will gain analytical and computational techniques that are useful for optimization research.

先修科目

Computer Programming or Data Structures

評分方式

Grading: homework & programming assignment 40% paper presentation: 15% term-project 35%; participation 10%

週次計畫
週次主題
第 1 週Overview and Introduction
第 2 週Review on Asymptotic Notations; Time Complexity; Lower bounds on Problem's Complexity
第 3 週Greedy Algorithms Theory of NP-completeness
第 4 週Theory of NP-completeness; Dynamic Programming
第 5 週National holiday
第 6 週Dynamic programming
第 7 週Mid-term presentation
第 8 週Mid-term presentation
第 9 週Dynamic programming
第 10 週Branch-and-Bound Algorithms; Lower Bounds and Upper Bounds (Lagrangian relaxation)
第 11 週Branch-and-Bound Algorithms; Lower Bounds and Upper Bounds (Lagrangian relaxation)
第 12 週Design and analysis of heuristics
第 13 週Design and analysis of approximation algorithms
第 14 週Design of PTAS and FPTAS
第 15 週Randomization Algorithms
第 16 週Projects
教科書

1. R.C.T. Lee, S.S. Tseng, R.C. Chang, Y.T.Tsai, Introduction to the Design and Analysis of Algorithms, McGraw-Hill, 2005. 2. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 4th Ed., MIT Press, 2022. 3. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979, San Francisco. 4. G. Ausiello, P. Cresenzi, G. Gambois, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag, 2003, Germany. 5. Selected journal papers

Office Hours
地點
MB310
時間
Monday EF, Thursday E
聯絡方式
5712121-31472 bmtlin@nycu.edu.tw