Skip to content

Syllabus

The full list of what the course contains, chapter by chapter and problem by problem. To find your way, start from Modelling and The problems; this page is for whoever wants to see everything at once.

Modelling

  1. What is a MIP model — data, variables, objective, constraints; relaxations, bounds and gaps
  2. Logic and binary variables — CNF, the three translation rules, five exercises
  3. Links between variables — the fourteen techniques, one per subpage, with the map
  4. Relaxations, duality and bounds — the conversion table, three recipes for a hand-built dual solution
  5. Constructive heuristics — the six rules, and when they fail
  6. From the model to Python/Gurobi — the four classes of variables, the tolerances, the course protocol

The problems

Fifteen numerical models — from EX 1 to EX 15, with the online page for

EX 2 Bus lines · EX 3 Relay · EX 4 Hub-and-spoke · EX 8 Seminars · EX 10 CNC tools · EX 12 Balancing

Assignment and scheduling

7.1 Minimum-cost assignment · 7.2 Machines with fixed cost · 7.3 Job selection · 7.4 Parallel jobs · 7.5 Classes with setup · 7.6 Classes with bonus · 7.7 Total tardiness

Location and coverage

8.1 Capacitated location · 8.2 p-median · 8.3 Coverage with interference · 8.4 Hub with maximum cost

Production planning

9.1 Lot sizing with fixed cost · 9.2 Production and workforce · 9.3 Vehicles with a minimum lot

Mixed problems

10.1 Prizes in two ways · 10.2 Combinatorial auction · 10.3 Diet with a minimum lot · 10.4 Trees and boxes of lights · 10.5 Shipments in boxes · 10.6 Children across summer camps · 10.7 Branches across two companies · 10.8 Songs across CDs · 10.9 Books across shelves

The course