Lecture

Relations Between Events

Description

This lecture covers the relations between events in optimization problems, including expressing constraints such as at most one event occurring, disjunctive constraints, and forcing constraints. It also delves into modeling with binary variables, the assignment problem, facility location problems, and the concept of spanning trees in graphs.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

adipisicing eu tempor nisi

Excepteur velit esse mollit eu ea et fugiat tempor excepteur irure cillum consequat nulla. Laborum duis occaecat excepteur do aliqua veniam aliquip. Deserunt do ut labore fugiat nulla anim. Dolor mollit aute sit deserunt amet laborum esse ullamco. Nostrud sunt occaecat aliqua sunt.

Official source

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

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

Mathematics

Discrete mathematics: Graph theory

Related lectures (73)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.