Skip to main content
top

Linear Programming 2

Faculty
Fakulta dopravní ČVUT
Semester
zimní
Course type
magisterský
Current
Yes
Web

Formulation of the task of integer programming, branch and bound method of numerical solution, problems about knapsack, travelling salesman, sets, location of stores and post boxes, tasks of scheduling, heuristics, metaheuristics - genetic algorithms, ant colony optimization.

Submitted by kadlecova on