Syllabus

bigskymanΤεχνίτη Νοημοσύνη και Ρομποτική

24 Οκτ 2013 (πριν από 3 χρόνια και 7 μήνες)

91 εμφανίσεις

Discrete Optimization

Spring 200
8

Syllabus

Instructor:


Shi
-
Chung Chang (
張時中
)


Lecture Time:

:
2

-

1
7
:
2
0


Cl慳sr潯o: R潯o
㄰1

BL
Bld朮


Office: R潯o ㈴㔬⁅E
-
II Bld朮ⰠTel:′㌶
2
-
㔱㠷


Office H潵rs: Frid慹a ㄺ〰0


2:00 pm or by appointment


Tentative Outli
ne

1.



Course Overview, Algorithms and Complexity and Basics of Optimization.

2.



Linear Programming: Problems, Properties and Simplex Algorithms

3.



Duality Theorem and Sensitivity

4.



Interior Point Methods for LP

5.



Network Representation and Shortest Path Algor
ithms

6.



Distributed Shortest Path Algorithms

7.



Minimum Spanning Tree Problem

8.



Maximum Flow and Minimum Cost Flow Algorithms

9.



Integer Programming Algorithms

10.

mid
-
term exam

11.

The Traveling Salesman Problem and Knapsack Problem

12.

Simulated Annealing

&
Tabu Searc
h

13.

Genetic Algorithms

&
Artificial Neural Networks for Optimization

14.

Constraint Optimization

15.

Specific Applications


Textbook

1.

C. H. Papadimitriou, K. Steiglitz,
Combinatorial Optimization:Algorithms and
Complexity
, Prentice Hall, 1982.

2.

E. Aarts, J. K. Lenstra
, eds.,
Local Search in Combinatorial Optimization,
Wiley, 1997.


Grading

Homework 30%
Mid
-
term Exam

35% Final Exam 35%

Participation 5%


Websites

http://recipe.ee.ntu.edu.tw/
Frame/DO/
ind
ex.htm



Reference
Links:

1.

http://en.wikipedia.org/wiki/Combinatorial_optimization

2.

J. of Combinatorial Opt.
http://www.klu
weronline.com/issn/1382
-
6905

3.

Discrete Optimization
http://www.elsevier.com/locate/disopt

4.

No free lunch in search and optimization

5.

Discrete Optimization methods

www.cs.sunysb.edu/~algorith/implement/syslo/implement.
shtml