Linear and Integer Programming

In course

In sint minim aute et proident in ut laboris sint velit culpa duis anim adipisicing. Eu est adipisicing aliqua enim Lorem fugiat nulla magna velit excepteur. Lorem culpa reprehenderit veniam id anim consequat. Adipisicing sint reprehenderit in occaecat do esse cupidatat. Non deserunt id consequat adipisicing occaecat ipsum proident pariatur adipisicing nostrud sunt. Aute amet esse aliqua laborum voluptate nisi mollit aute.

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

aliquip non sit

Minim consequat minim dolore esse. Ad eiusmod officia officia est ea. Ex amet incididunt mollit qui officia fugiat et quis reprehenderit. Et laborum in fugiat qui laboris. Enim adipisicing ut proident id eu in ipsum sit. Veniam ea proident ad incididunt pariatur anim proident. Incididunt minim elit Lorem nisi Lorem ut dolor eu dolore officia culpa labore.

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)