T: The Travelling Salesperson Problem and NP Complete Optimization
-
T: Branch and Cut -- the best known way of solving the TSP
-
A: Classic airline scheduling problems
-
T: Linear Programming -- main practical optimization method -- and its generalizations
|
T: Genetic Algorithms
-
When are these competitive with other approaches
|
A: Some real world Optimization Problems
-
A: Constrained (avoid obstacles) motion of Robot arms
-
A: Scheduling of University Classes
-
A: Datamining (see Case Study III) on databases in information arena)
|
T: General theory of Physical Computation and Complex Systems
|