<?xml version="1.0"?>
<oembed><version>1.0</version><provider_name>IMDEA Networks</provider_name><provider_url>https://networks.imdea.org/es</provider_url><author_name>in_admin</author_name><author_url>https://networks.imdea.org/es/author/in_admin/</author_url><title>Network Optimisation - IMDEA Networks</title><type>rich</type><width>600</width><height>338</height><html>&lt;blockquote class="wp-embedded-content" data-secret="rfrRHOlJXq"&gt;&lt;a href="https://networks.imdea.org/es/actualidad/agenda-de-eventos/network-optimisation/"&gt;Network Optimisation&lt;/a&gt;&lt;/blockquote&gt;&lt;iframe sandbox="allow-scripts" security="restricted" src="https://networks.imdea.org/es/actualidad/agenda-de-eventos/network-optimisation/embed/#?secret=rfrRHOlJXq" width="600" height="338" title="&#xAB;Network Optimisation&#xBB; &#x2014; IMDEA Networks" data-secret="rfrRHOlJXq" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" class="wp-embedded-content"&gt;&lt;/iframe&gt;&lt;script type="text/javascript"&gt;
/* &lt;![CDATA[ */
/*! This file is auto-generated */
!function(d,l){"use strict";l.querySelector&amp;&amp;d.addEventListener&amp;&amp;"undefined"!=typeof URL&amp;&amp;(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&amp;&amp;!/[^a-zA-Z0-9]/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret="'+t.secret+'"]'),o=l.querySelectorAll('blockquote[data-secret="'+t.secret+'"]'),c=new RegExp("^https?:$","i"),i=0;i&lt;o.length;i++)o[i].style.display="none";for(i=0;i&lt;a.length;i++)s=a[i],e.source===s.contentWindow&amp;&amp;(s.removeAttribute("style"),"height"===t.message?(1e3&lt;(r=parseInt(t.value,10))?r=1e3:~~r&lt;200&amp;&amp;(r=200),s.height=r):"link"===t.message&amp;&amp;(r=new URL(s.getAttribute("src")),n=new URL(t.value),c.test(n.protocol))&amp;&amp;n.host===r.host&amp;&amp;l.activeElement===s&amp;&amp;(d.top.location.href=t.value))}},d.addEventListener("message",d.wp.receiveEmbedMessage,!1),l.addEventListener("DOMContentLoaded",function(){for(var e,t,s=l.querySelectorAll("iframe.wp-embedded-content"),r=0;r&lt;s.length;r++)(t=(e=s[r]).getAttribute("data-secret"))||(t=Math.random().toString(36).substring(2,12),e.src+="#?secret="+t,e.setAttribute("data-secret",t)),e.contentWindow.postMessage({message:"ready",secret:t},"*")},!1)))}(window,document);
//# sourceURL=https://networks.imdea.org/wp-includes/js/wp-embed.min.js
/* ]]&gt; */
&lt;/script&gt;
</html><thumbnail_url>https://networks.imdea.org/wp-content/uploads/2020/01/1148_01_network20optimisation.png</thumbnail_url><thumbnail_width>250</thumbnail_width><thumbnail_height>180</thumbnail_height><description>This course is focused on the optimization problems that arise in network communications design and planning. First the mathematical techniques involved in constrained optimization are introduced. Then, a taxonomy of network planning problems is reviewed. Representative examples are provided and modeled as constrained optimization problems. After that, algorithm and problem complexity classification is introduced, next to an evaluation of complexity issues in constrained optimization problems. Finally, a section introducing graph theory as a feasible approach for network optimization is included.</description></oembed>
