Home » Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization
Overview

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

Course Authors

Prof. Andreas Schulz | Prof. Dimitris Bertsimas

  • Course Level: Graduate
  • Subject: Mathematics
  • Fees: TBA
  • Language: English
  • Certificate: Available
  • Duration:
  • Provider: