Linear and Integer Programming

In course

Aliqua labore dolor cillum magna magna sint sit quis nisi tempor voluptate ut cupidatat. Dolore eiusmod consequat deserunt ea elit fugiat. Mollit id fugiat in in quis Lorem ipsum commodo proident dolore cupidatat nisi cupidatat. Nostrud sunt exercitation voluptate duis eu do. Reprehenderit sit veniam reprehenderit labore fugiat aliquip culpa pariatur mollit. Velit occaecat tempor adipisicing id proident dolor nulla elit sint consequat voluptate sint culpa.

Description

This lecture covers the theory of linear and integer programming, focusing on topics such as the integer hull, convex sets, polyhedra, and linear programs. It also discusses the Minkowski-Weyl theorem and rational polyhedra.

Instructor

sint sunt amet

Non consequat laborum occaecat aute. Dolore qui pariatur exercitation est anim veniam fugiat laboris irure. Cillum incididunt nulla pariatur eu.

Official source

https://mediaspace.epfl.ch/media/0_84llnxx6

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Related lectures (35)