Editing Discrete optimization (section)

{{Short description|Branch of mathematical optimization}}
'''Discrete optimization''' is a branch of [[Optimization (mathematics)|optimization]] in [[applied mathematics]] and [[computer science]]. As opposed to [[continuous optimization]], some or all of the [[Variable (mathematics)|variables]] used in a discrete optimization problem are restricted to be [[discrete variable]]s&mdash;that is, to assume only a [[discrete mathematics|discrete]] set of values, such as the [[integer]]s.<ref>{{citation|title=A First Course in Combinatorial Optimization|volume=36|series=Cambridge Texts in Applied Mathematics|first=Jon|last=Lee|publisher=Cambridge University Press|year=2004|isbn=9780521010122|page=1|url=https://books.google.com/books?id=3pL1B7WVYnAC&pg=PA1}}.</ref>