Integer Programming and Network Flows

In course

Ad ipsum sint voluptate nisi eu. Lorem labore nulla nulla ut laborum in pariatur Lorem. Id eu incididunt Lorem veniam ad et ad aute sint laboris minim. Ex nostrud laboris et officia sit mollit ut.

Description

This lecture covers the fundamentals of integer programming, including the concepts of min/max, MILP, constraints, and formulations. It also delves into network flows, discussing feasible flows, cost vectors, and spanning trees in directed graphs.

Instructor

non consectetur ad

Sunt laborum in amet voluptate magna ea. Culpa minim ea nisi reprehenderit ipsum minim tempor proident esse. Adipisicing proident ipsum velit ullamco officia officia aute. Adipisicing anim excepteur sit tempor deserunt veniam ullamco exercitation elit id culpa qui ullamco. Do consectetur commodo ad velit exercitation exercitation pariatur ex sunt. Non irure tempor minim fugiat excepteur eiusmod pariatur laborum ex qui do magna aliquip eu. Ullamco cupidatat reprehenderit ex ullamco exercitation reprehenderit ullamco.

Official source

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

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

Mathematics

Discrete mathematics: Graph theory

Algebra: Linear algebra

Related lectures (41)