<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.sarg.dev/index.php?action=history&amp;feed=atom&amp;title=Discrete_optimization</id>
	<title>Discrete optimization - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.sarg.dev/index.php?action=history&amp;feed=atom&amp;title=Discrete_optimization"/>
	<link rel="alternate" type="text/html" href="https://wiki.sarg.dev/index.php?title=Discrete_optimization&amp;action=history"/>
	<updated>2026-06-20T14:40:19Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.2</generator>
	<entry>
		<id>https://wiki.sarg.dev/index.php?title=Discrete_optimization&amp;diff=263262&amp;oldid=prev</id>
		<title>imported&gt;Altenmann: Reverted 1 edit by IsaacFG12345 (talk)</title>
		<link rel="alternate" type="text/html" href="https://wiki.sarg.dev/index.php?title=Discrete_optimization&amp;diff=263262&amp;oldid=prev"/>
		<updated>2024-07-12T15:49:38Z</updated>

		<summary type="html">&lt;p&gt;Reverted 1 edit by &lt;a href=&quot;/index.php/Special:Contributions/IsaacFG12345&quot; title=&quot;Special:Contributions/IsaacFG12345&quot;&gt;IsaacFG12345&lt;/a&gt; (&lt;a href=&quot;/index.php?title=User_talk:IsaacFG12345&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;User talk:IsaacFG12345 (page does not exist)&quot;&gt;talk&lt;/a&gt;)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Branch of mathematical optimization}}&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Discrete optimization&amp;#039;&amp;#039;&amp;#039; 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&amp;amp;mdash;that is, to assume only a [[discrete mathematics|discrete]] set of values, such as the [[integer]]s.&amp;lt;ref&amp;gt;{{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&amp;amp;pg=PA1}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Branches==&lt;br /&gt;
Three notable branches of discrete optimization are:&amp;lt;ref&amp;gt;{{citation&lt;br /&gt;
 | last1 = Hammer | first1 = P. L.&lt;br /&gt;
 | last2 = Johnson | first2 = E. L.&lt;br /&gt;
 | last3 = Korte | first3 = B. H.&lt;br /&gt;
 | contribution = Conclusive remarks&lt;br /&gt;
 | pages = 427–453&lt;br /&gt;
 | publisher = Elsevier&lt;br /&gt;
 | series = Annals of Discrete Mathematics&lt;br /&gt;
 | title = Discrete Optimization II&lt;br /&gt;
 | volume = 5&lt;br /&gt;
 | year = 2000}}.&amp;lt;/ref&amp;gt;&lt;br /&gt;
* [[combinatorial optimization]], which refers to problems on [[Graph (discrete mathematics)|graph]]s, [[matroid]]s and other discrete structures&lt;br /&gt;
* [[integer programming]] &lt;br /&gt;
* [[constraint programming]]&lt;br /&gt;
These branches are all closely intertwined however, since many combinatorial optimization problems &lt;br /&gt;
can be modeled as integer programs (e.g. [[Shortest path#Linear programming formulation|shortest path]]) or constraint programs,&lt;br /&gt;
any constraint program can be formulated as an integer program and vice versa,&lt;br /&gt;
and constraint and integer programs can often be given a combinatorial interpretation.&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Diophantine equation]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
{{Authority control}}&lt;br /&gt;
{{Mathematical optimization}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Mathematical optimization]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Altenmann</name></author>
	</entry>
</feed>