Discrete optimization
Branch of mathematical optimization
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 optimization problem are restricted to be discrete variables, that is, to assume only a discrete set of values, such as the integers.
01Branches
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.
Sources and credits
This article is adapted from the Wikipedia article “Discrete optimization”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.
