Lecture

Discrete Optimization: Relaxation

Description

This lecture explains how to solve discrete optimization problems by relaxing integrality constraints, turning them into linear optimization problems. The relaxation provides a lower bound on the optimal solution, but rounding the relaxed solution may not work for finding feasible solutions.

In MOOCs (6)

Instructor

culpa laborum est

Id nisi ullamco reprehenderit ut tempor fugiat esse et fugiat. Officia commodo dolor eu consectetur culpa ea adipisicing veniam ad. Incididunt aute cupidatat sunt cupidatat minim anim id reprehenderit occaecat incididunt culpa duis incididunt nostrud.

Official source

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

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 (50)

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.