{"id":84960,"date":"2000-12-06T00:00:00","date_gmt":"2000-12-06T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/cycle-location-problems\/"},"modified":"2000-12-06T00:00:00","modified_gmt":"2000-12-06T00:00:00","slug":"cycle-location-problems","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/cycle-location-problems\/","title":{"rendered":"Cycle location problems"},"content":{"rendered":"<h2>Tesis doctoral de <strong> Inmaculada Rodr\u00edguez Martin <\/strong><\/h2>\n<p>La presente memoria est\u00e1 dedicada al estudio de los problemas del ciclo mediana mcp, consistentes en ubicar en un grafo completo mixto un cilco que visita un determinado v\u00e9rtice, teniendo en cuenta el coste total de establecimiento del ciclo y el costo total de accsibilidad al mismo, defini\u00e9ndose \u00e9ste \u00faltimo como la suma de las distancias de los v\u00e9rtices no visitados al ciclo.  en primer lugar se revisa la literatura existente sobre problemas bicriterio de localizaci\u00f3n de estructuas con forma de camino, \u00e1rbol y ciclo. Adem\u00e1s, se proponen formulaciones matem\u00e1ticas gen\u00e9ricas para este tipo de problemas.  en el cap\u00edtulo 3 presentamos dos versiones de mcp. En la primera, mcp1, el objetivo es encontrar el ciclo que minimiza la suma de los dos tipos de costos (de establecimiento y de accesibilidad). En la segunda, mcp2, el objetivo es encontrar el ciclo con un menor costo de establecimiento entre todos los que tienen el costo total de accesibilidad acotado por un valor dado. Demostramos que los dos problemas son np duros en sentido fuerte y proponemos formulaciones matem\u00e1ticas para ambos. As\u00ed mismo, demostramos que una serie de inecuaciones son v\u00e1lidas a la hora de reforzar la relajaci\u00f3n lineal de los modelos matem\u00e1ticos.  el cap\u00edtulo 4 est\u00e1 dedicado al estudio del poliedro asociado al problema mcp1. Probamos una serie de resutlados que establecen la dimensi\u00f3n de este poliedro y muestran distintos tipos de inecuaciones que definen facetas del mismo. Estos resutlados son utilizados para dise\u00f1ar los algoritmos de ramificaci\u00f3n y corte que se describen en el cap\u00edtulo 5, y que nos permiten resolver mcp1 y mcp2 de forma exacta.  en el cap\u00edtulo 6 presentamos una nueva t\u00e9cnica metaheur\u00edstica denominada b\u00fasqueda tab\u00fa de entorno variable (vnts), y describimos su aplicaci\u00f3n para la resoluci\u00f3n de los mcp.  en cap\u00edtulo 7 muestra los resultados computacionales obtenidos usando los m\u00e9todos exactos y heur\u00edsticos descritos<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Cycle location problems<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Cycle location problems <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Inmaculada Rodr\u00edguez Martin <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 La laguna<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 12\/06\/2000<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li> Moreno Perez Jos\u00e9 Andres<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Juan  Antonio Mesa l\u00f3pez-colmenar <\/li>\n<li>leopoldo Acosta sanchez (vocal)<\/li>\n<li>pedro Larra\u00f1aga mugica (vocal)<\/li>\n<li>dolores Santos pe\u00f1ate (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Inmaculada Rodr\u00edguez Martin La presente memoria est\u00e1 dedicada al estudio de los problemas del ciclo mediana mcp, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[1890,37303,2528,6264,9915,126,11392],"tags":[31080,179164,90446,39611,39770,45386],"class_list":["post-84960","post","type-post","status-publish","format-standard","hentry","category-ciencia-de-los-ordenadores","category-heuristica","category-inteligencia-artificial","category-investigacion-operativa","category-la-laguna","category-matematicas","category-programacion-entera","tag-dolores-santos-penate","tag-inmaculada-rodriguez-martin","tag-juan-antonio-mesa-lopez-colmenar","tag-leopoldo-acosta-sanchez","tag-moreno-perez-jose-andres","tag-pedro-larranaga-mugica"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/84960","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=84960"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/84960\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=84960"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=84960"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=84960"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}