{"id":38126,"date":"1998-06-05T00:00:00","date_gmt":"1998-06-05T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/arboles-y-heuristicas-en-localizacion-el-modelo-centdian-multiple\/"},"modified":"1998-06-05T00:00:00","modified_gmt":"1998-06-05T00:00:00","slug":"arboles-y-heuristicas-en-localizacion-el-modelo-centdian-multiple","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/arboles-y-heuristicas-en-localizacion-el-modelo-centdian-multiple\/","title":{"rendered":"Arboles y heuristicas en localizacion. el modelo centdian multiple."},"content":{"rendered":"<h2>Tesis doctoral de <strong> Dionisio P\u00e9rez Brito <\/strong><\/h2>\n<p>La memoria desde el punto de vista de los contenidos consta de dos partes vinculadas entre si. En la primera, con el objetivo de reflejar el estado actual de los problemas de localizaci\u00f3n en \u00e1rboles, se realiza un repaso de los modelos cl\u00e1sicos tanto en el \u00e1rbol como en su representaci\u00f3n m\u00e1s simple, la recta real. adem\u00e1s, se recuerdan otros problemas que tambi\u00e9n tienen gran relevancia en el \u00e1mbito de la localizaci\u00f3n en \u00e1rboles. En esta l\u00ednea, se proponen varias estrategias heur\u00edsticas para resolver problemas de localizaci\u00f3n en grafos, haciendo uso de los algoritmos construidos para \u00e1rboles, obteni\u00e9ndose en muy poco tiempo soluciones pr\u00f3ximas a la \u00f3ptima. Tambi\u00e9n hay que resaltar los resultados de la heur\u00edstica vnds, que ha sido dise\u00f1ada para resolver problemas de optimizaci\u00f3n combinatoria en grafos de dimensiones considerables. Esta ha sido probada con grafos del orden de 6000 v\u00e9rtices, mejorando apreciablemente los resultados obtenidos con otras heur\u00edsticas. En la segunda, se estudia la funci\u00f3n centdian en un grafo considerando la funci\u00f3n centro ponderada, generalizando as\u00ed el modelo de halpern. Se realiza un an\u00e1lisis del 2-lamda-centdian, y se propone un algoritmo de complejidad o(m2n4), donde m y n son respectivamente el n\u00famero de aristas y v\u00e9rtices del grafo considerado. adem\u00e1s se presenta un contraejemplo al conjunto finito dominante propuesto por hooker y otros. En contrapartida se presenta un nuevo conjunto finito dominante para el problema p-lamda-centdian en un grafo con una demostraci\u00f3n detallada del mismo. Finalmente, como consecuencia de \u00e9ste, se propone un algoritmo exacto. El trabajo concluye estudiando el problema p-lamda-centdian en un \u00e1rbol, proponiendose el primer algoritmo polinomial para el problema p-lamda-centdian (generalizado o no) en \u00e1rboles.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Arboles y heuristicas en localizacion. el modelo centdian multiple.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Arboles y heuristicas en localizacion. el modelo centdian multiple. <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Dionisio P\u00e9rez Brito <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 La laguna<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 06\/05\/1998<\/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>candelaria Espinel febles (vocal)<\/li>\n<li>dolores Santos pe\u00f1ate (vocal)<\/li>\n<li>pino Caballero gil (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Dionisio P\u00e9rez Brito La memoria desde el punto de vista de los contenidos consta de dos partes [&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,9915,126],"tags":[72856,47124,31080,90446,39770,49158],"class_list":["post-38126","post","type-post","status-publish","format-standard","hentry","category-ciencia-de-los-ordenadores","category-heuristica","category-inteligencia-artificial","category-la-laguna","category-matematicas","tag-candelaria-espinel-febles","tag-dionisio-perez-brito","tag-dolores-santos-penate","tag-juan-antonio-mesa-lopez-colmenar","tag-moreno-perez-jose-andres","tag-pino-caballero-gil"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/38126","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=38126"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/38126\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=38126"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=38126"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=38126"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}