Discrete optimization
Jump to navigation
Jump to search
This content was retrieved from
Wikipedia : http://en.wikipedia.org/wiki/Discrete_optimizationDiscrete optimization is a branch of optimization in applied mathematics and computer science.
Contents
Scope
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.^{[1]}
Branches
Two notable branches of discrete optimization are:^{[2]}
- combinatorial optimization, which refers to problems on graphs, matroids and other discrete structures
- integer programming
These branches are closely intertwined however since many combinatorial optimization problems can be modeled as integer programs (e.g. shortest path) and conversely, integer programs can often be given a combinatorial interpretation.
See also
References
- ^ Lee, Jon (2004), A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics, 36, Cambridge University Press, p. 1, ISBN 9780521010122.
- ^ Hammer, P. L.; Johnson, E. L.; Korte, B. H. (2000), "Conclusive remarks", Discrete Optimization II, Annals of Discrete Mathematics, 5, Elsevier, pp. 427–453.
This page is based on the copyrighted Wikipedia article "Discrete optimization"; it is used under the Creative Commons
Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may
redistribute it, verbatim or modified, providing that you comply with
the terms of the CC-BY-SA