Discrete optimization

Discrete optimization is a branch of optimization in applied mathematics and computer science.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

Branches

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.

See also

Diophantine equation

Text derived from https://en.wikipedia.org/w/index.php?oldid=1234100282 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001234100282 · captured 1720792178.0 · version history

Cite this page as: encyclopegia.org, “Discrete optimization”, snapshot enwiki-001234100282. https://encyclopegia.org/a/discrete-optimization

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.