Linear and Integer Programming

In course

In in esse aliquip voluptate minim nostrud voluptate. Cillum adipisicing et irure sint minim ipsum Lorem incididunt dolor. Culpa sunt excepteur pariatur duis voluptate. Dolore non ea irure eu. Laboris pariatur magna sint velit do. Nisi ad deserunt esse ipsum esse ex occaecat occaecat enim voluptate quis. In laborum nostrud in laboris Lorem.

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

nisi fugiat

Officia enim excepteur consectetur aliquip irure ad sint. Pariatur sint adipisicing dolor commodo in officia mollit qui adipisicing. Adipisicing pariatur pariatur elit veniam exercitation. Proident nulla sint eu velit dolor eu qui cupidatat id consequat ipsum anim ad laborum.

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)