Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Integer Programming Basics
Description
This lecture covers the basics of integer programming, focusing on problems where variables are restricted to integer values. It explains how to formulate and solve these problems, including capacitated problems and negative cost cycles. The instructor discusses the simplex algorithm, Bland's algorithm, and the convergence of integer programming. The lecture also addresses the advantages of negative cost cycles and the importance of dual LP relaxation in solving generic integer programs.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.