Welcome to Integer Linear Programming
Description: An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. In contrast to (ordinary) linear programming, which is solvable in polynomial time, ILP is NP-hard. However, there are several problems which may be naturally formulated as ILP, e.g. task-graph scheduling, travelling sales-person problem, worst-case execution time analysis of code. The course will provide provide heuristics for how to solve ILP efficiently for several practical instances.
November 18 from 13:00 to 15:00
November 21 from 13:00 to 15:00
November 22 from 13:00 to 15:00
November 23 from 10:00 to 12:00
November 24 from 13:00 to 15:00
November 25 from 13:00 to 15:00
Place: Cassiopaia, Selma Lagerlöfsvej 300.
November 18, 21, 22, 23 and 25: Room 0.2.12
November 24: Room 0.1.12.
Zip code: 9220
City: Aalborg Ø
Number of seats:
Deadline: October 28
Important information concerning PhD courses
We have over some time experienced problems with no-show for both project and general courses. It has now reached a point where we are forced to take action. Therefore, the Doctoral School has decided to introduce a no-show fee of DKK 5,000 for each course where the student does not show up. Cancellations are accepted no later than 2 weeks before start of the course. Registered illness is of course an acceptable reason for not showing up on those days. Furthermore, all courses open for registration approximately three months before start. This can hopefully also provide new students a chance to register for courses during the year. We look forward to your registrations.
- Teacher: Kim Guldstrand Larsen