Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Discrete optimization
Summary
Discrete optimization is a branch of optimization in applied mathematics and computer science.
As opposed to continuous optimization, some or all of the variables used in a discrete mathematical program are restricted to be discrete variables—that is, to assume only a discrete set of values, such as the integers.
Three notable branches of discrete optimization are:
combinatorial optimization, which refers to problems on graphs, matroids and other discrete structures
integer programming
constraint programming
These branches are all closely intertwined however since many combinatorial optimization problems
can be modeled as integer programs (e.g. shortest path) or constraint programs,
any constraint program can be formulated as an integer program and vice versa,
and constraint and integer programs can often be given a combinatorial interpretation.
Official source
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.