Discrete Optimization: Modeling

Description

This lecture covers logical operations such as conjunction, disjunction, exclusive disjunction, and implication, as well as optional and disjunctive constraints and linearization in the context of discrete optimization modeling.

In MOOCs (6)

Instructor

elit fugiat quis

Ad do eu duis occaecat deserunt voluptate elit. Veniam laborum excepteur ad magna veniam adipisicing quis enim. Nostrud elit pariatur duis in do. Pariatur adipisicing occaecat aliqua quis. Proident in duis aliqua officia deserunt duis nulla. Labore reprehenderit id qui aute nisi nisi amet.

Official source

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

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

Logic

Classical logic: First-order logic

Related lectures (32)

Covers propositional logic, equivalence proofs, and normal forms using truth tables.

Covers propositional logic, logical equivalence, tautology, contradiction, and normal forms.

Explores common multiplicand speedup through logical operations like bitwise AND and XOR to optimize the multiplication process.

Covers propositional logic, truth tables, and problem-solving strategies in discrete mathematics.

Covers the basics of discrete mathematics, including logic, structures, and algorithms.