http://wiki.karljones.com/index.php?action=history&feed=atom&title=Combinatorial_optimization 2026-10-23T17:12:58Z Revision history for this page on the wiki MediaWiki 1.24.2 http://wiki.karljones.com/index.php?title=Combinatorial_optimization&diff=18160&oldid=prev 2016-09-09T18:48:03Z

<p>‎<span dir="auto"><span class="autocomment">Specific problems</span></span></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 18:48, 9 September 2016</td> </tr><tr><td colspan="2" class="diff-lineno">Line 27:</td> <td colspan="2" class="diff-lineno">Line 27:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Minimum spanning tree]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Minimum spanning tree]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Nurse scheduling problem]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Nurse scheduling problem]]</div></td></tr> <tr><td colspan="2">&#160;</td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">* [[Stable marriage problem]]</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Traveling salesman problem]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Traveling salesman problem]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Vehicle routing problem]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>* [[Vehicle routing problem]]</div></td></tr> </table>

Karl Jones http://wiki.karljones.com/index.php?title=Combinatorial_optimization&diff=18159&oldid=prev 2016-09-09T18:46:23Z

<p>Created page with &quot;In <a href="/index.php/Applied_mathematics" title="Applied mathematics">applied mathematics</a> and <a href="/index.php/Theoretical_computer_science" title="Theoretical computer science">theoretical computer science</a>, &#039;&#039;&#039;combinatorial optimization&#039;&#039;&#039; is a topic that consists of finding an optimal object from a <a href="/index.php?title=Finite_set&amp;action=edit&amp;redlink=1" class="new" title="Finite set (page does not exist)">finite set</a> o...&quot;</p> <p><b>New page</b></p><div>In [[applied mathematics]] and [[theoretical computer science]], '''combinatorial optimization''' is a topic that consists of finding an optimal object from a [[finite set]] of objects.<br /> <br /> == Description ==<br /> <br /> In many such problems, [[brute-force search]] is not feasible. It operates on the domain of those optimization problems, in which the set of feasible solutions is discrete or can be reduced to discrete, and in which the goal is to find the best solution.<br /> <br /> Some common problems involving combinatorial optimization are the [[traveling salesman problem]] (&quot;TSP&quot;) and the [[minimum spanning tree problem]] (&quot;MST&quot;).<br /> <br /> Combinatorial optimization is a subset of [[mathematical optimization]] that is related to [[operations research]], [[algorithm theory]], and [[computational complexity theory]].<br /> <br /> It has important applications in several fields, including [[artificial intelligence]], [[machine learning]], [[mathematics]], [[auction theory]], and [[software engineering]].<br /> <br /> Some research literature considers discrete optimization to consist of integer programming together with combinatorial optimization (which in turn is composed of optimization problems dealing with graph structures) although all of these topics have closely intertwined research literature. It often involves determining the way to efficiently allocate resources used to find solutions to mathematical problems.<br /> <br /> == See also ==<br /> <br /> * [[Mathematical optimization]]<br /> <br /> === Specific problems ===<br /> <br /> * [[Assignment problem]]<br /> * [[Closure problem]]<br /> * [[Constraint satisfaction problem]]<br /> * [[Cutting stock problem]]<br /> * [[Integer programming]]<br /> * [[Knapsack problem]]<br /> * [[Minimum spanning tree]]<br /> * [[Nurse scheduling problem]]<br /> * [[Traveling salesman problem]]<br /> * [[Vehicle routing problem]]<br /> * [[Vehicle rescheduling problem]]<br /> * [[Weapon target assignment problem]]<br /> <br /> == External links ==<br /> <br /> * [https://en.wikipedia.org/wiki/Combinatorial_optimization Combinatorial optimization] @ Wikipedia<br /> <br /> <br /> [[Category:Mathematics]]</div>

Karl Jones