Alle Beiträge: Unterschied zwischen den Versionen

Aktuelle Version vom 10. Juni 2013, 15:10 Uhr

1. Shortest paths: Dijkstra and Floyd
2. Longest paths: Dijkstra
3. Cost minimal maximum flow in graphs: Ford-Fulkerson
4. Transportation problem: Construction of starting solution
5. Transportation problem: Iterative optimization method
6. Assignment problem: Hungarian method
7. Linear optimization: Mathematical formulations of problems presented in the course
8. Linear optimization: Formulation and graphical solution of a LP
9. Linear optimization: Mathematical formulations of complex problems (How to)
10. Linear optimization: Pivot selection rules
11. Linear optimization: Phases of the Simplex method
12. Linear optimization: Upper and lower bounds
13. Linear optimization: Sensibility analysis
14. Linear optimization: Parametrical objective function
15. Integer linear optimization: Cutting Planes
16. Integer linear optimization: Branch & Bound
17. Combinatorial optimization: Knapsack problem
18. Queuing theory
19. Enumeration methods
20. Heuristics: Minimal Spanning Tree
21. Heuristics: A*-algorithm
22. Heuristics: Local search
23. Heuristics: Simulated Annealing
24. Heuristics: Genetic Algorithm
25. Nonlinear Opt.: Basic concepts
26. Nonlinear Opt.: Classical gradient method
27. Nonlinear Opt.: Gold section search
28. Nonlinear Opt.: Lagrangian condition
29. Nonlinear Opt.: KKT- theorem
30. Nonlinear Opt.: Wolfe algorithm
31. Nonlinear Opt.: Auxiliary functions
32. Heuristics: Representation of Search Space and Neighborhoods
33. Nonlinear Opt.: Quadratic Problems
34. Nonlinear Opt.: Examples and Modeling
35. TSP Software