• Graduate Program
    • Why study Business Data Science?
    • Program outline
    • Courses
    • Course registration
    • Admissions
    • Facilities
      • Student Offices
      • Location
      • Housing
      • Student Council
  • Research
  • News
  • Events
    • Events Calendar
    • Events archive
    • Summer School
      • Behavioral Decision Making
      • Deep Learning
      • Econometrics and Data Science Methods for Business and Economics and Finance
      • Foundations of Data Analysis and Machine Learning in Python
      • Introduction to Genome-Wide Data Analysis
      • Reinforcement Learning
      • Tinbergen Institute Summer School Program
  • Summer School
  • Alumni
Home | Courses | Integer Linear Programming
Course

Integer Linear Programming


  • Teacher(s)
    Wout Dullaert, Markus Leitner
  • Research field
    Supply Chain Analytics
  • Dates
    Period 5 - May 02, 2022 to Jul 15, 2022
  • Course type
    Field
  • Program year
    First
  • Credits
    3

Course description

External participants are invited to register for this course. (PhD) students register here, others register here. More information on course registration and course fees can be found here.

The main topics addressed in this course are:

  • Mathematical modelling via Linear Programming (LP) and Integer Linear Programming (ILP);
  • Types of objectives and constraints in LPs and ILPs;
  • Network models in LP (transportation, assignment, transhipment, min-cost flow, shortest path, max-flow, critical path analysis);
  • Validation and interpretation of LPs and sensitivity analysis;
  • Use of discrete variables and types of constraints in ILP;
  • Special types of ILPs (set covering/packing/partitioning, knapsack, traveling salesman, and vehicle routing);
  • Use of OpenSolver and/or Pyomo (Python) to solve LPs and ILPs.

Course literature

Textbook:

Model Building in Mathematical Programming 5th edition, written by H. Paul Williams, published by Wiley, ISBN: 978-1-118-44333-0.

Lecture notes available on Canvas.