Alle Beiträge
Aus Operations-Research-Wiki
- Shortest paths: Dijkstra and Floyd
- Longest paths: Dijkstra
- Cost minimal maximum flow in graphs: Ford-Fulkerson
- Transportation problem: Construction of starting solution
- Transportation problem: Iterative optimization method
- Assignment problem: Hungarian method
- Linear optimization: Mathematical formulations of problems presented in the course
- Linear optimization: Formulation and graphical solution of a LP
- Linear optimization: Mathematical formulations of complex problems (How to)
- Linear optimization: Pivot selection rules
- Linear optimization: Phases of the Simplex method
- Linear optimization: Upper and lower bounds
- Linear optimization: Sensibility analysis
- Linear optimization: Parametrical objective function
- Integer linear optimization: Cutting Planes
- Integer linear optimization: Branch & Bound
- Combinatorial optimization: Knapsack problem
- Queuing theory
- Enumeration methods
- Heuristics: Minimal Spanning Tree
- Heuristics: A*-algorithm
- Heuristics: Local search
- Heuristics: Simulated Annealing
- Heuristics: Genetic Algorithm
- Nonlinear Opt.: Basic concepts
- Nonlinear Opt.: Classical gradient method
- Nonlinear Opt.: Gold section search
- Nonlinear Opt.: Lagrangian condition
- Nonlinear Opt.: KKT- theorem
- Nonlinear Opt.: Wolfe algorithm
- Nonlinear Opt.: Auxiliary functions
- Heuristics: Representation of Search Space and Neighborhoods
- Nonlinear Opt.: Quadratic Problems
- Nonlinear Opt.: Examples and Modeling
- TSP Software