{"id":6775,"date":"1995-01-01T00:00:00","date_gmt":"1995-01-01T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/1995\/01\/01\/el-problema-del-k-centro-en-rn-con-normas-lpb-estrictas\/"},"modified":"1995-01-01T00:00:00","modified_gmt":"1995-01-01T00:00:00","slug":"el-problema-del-k-centro-en-rn-con-normas-lpb-estrictas","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/el-problema-del-k-centro-en-rn-con-normas-lpb-estrictas\/","title":{"rendered":"El problema del k-centro en rn con normas lpb estrictas."},"content":{"rendered":"<h2>Tesis doctoral de <strong> Lazaro Canovas Martinez <\/strong><\/h2>\n<p>Se plantea el problema de encontrar un conjunto c de k puntos en irn, tal que la distancia maxima entre c y cada elemento de un conjunto finito dado a sea minima.  aplicaciones pueden encontrarse en localizacion de servicios de emergencia, centros de transmision multionda y clasificacion de datos. Se estudia el problema cuando la distancia viene medida por una norma lpb con 1&lt;p&lt;infinito, b=(b1,&#8230;, Bn), bj 0, j=l,&#8230;,N.  para k=1, se obtienen algoritmos primales y duales basados respectivamente en el metodo de direcciones factibles y en la determinacion de una solucion optima mediante n+1 puntos del conjunto a. Para k l, se demuestra que el problema es equivalente a un problema de optimizacion discreta, y se presenta un algoritmo exacto para su resolucion, que solo es viable para a&lt;ir2 y m&lt;100, debido a la np-dureza del problema.  para la obtencion de soluciones en irn y m 100, se presentan algoritmos heuristicos, basados en una nueva regla de asignacion de los puntos de a a los centros de c, y se estudian sus propiedades. Se realizan estudios computacionales para n=2, 4, 6, 8 y 10 y m=500t, t=l,&#8230;,10 que permiten comparar los diferentes algoritmos propuestos, y establecer conclusiones en cuanto a su tiempo de computacion y calidad de la solucion obtenida. Para k=l, se obtienen buenos resultados en tiempos de computacion inferiores a 15 seg.  en todos los casos. Para k l, los algoritmos obtenidos se ejecutan con menores tiempos de computacion y proporcionan mejores valores objetivo que cuando se asignan los puntos a los centros mas cercanos, siendo los tiempos de computacion inferiores a 10 seg. En todos los casos.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>El problema del k-centro en rn con normas lpb estrictas.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 El problema del k-centro en rn con normas lpb estrictas. <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Lazaro Canovas Martinez <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Murcia<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1995<\/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>Blas Pelegrin Pelegrin<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Procopio Zoroa Terol <\/li>\n<li>Miguel Sanchez Garcia (vocal)<\/li>\n<li>Rafael Infante Mac\u00edas (vocal)<\/li>\n<li>Jos\u00e9 Mar\u00eda Ruiz Gomez (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Lazaro Canovas Martinez Se plantea el problema de encontrar un conjunto c de k puntos en irn, [&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":[6264,126,8235,8166],"tags":[24947,24949,24946,7603,24948,3739],"class_list":["post-6775","post","type-post","status-publish","format-standard","hentry","category-investigacion-operativa","category-matematicas","category-murcia","category-programacion-no-lineal","tag-blas-pelegrin-pelegrin","tag-jose-maria-ruiz-gomez","tag-lazaro-canovas-Martinez","tag-miguel-sanchez-garcia","tag-procopio-zoroa-terol","tag-rafael-infante-macias"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/6775","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=6775"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/6775\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=6775"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=6775"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=6775"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}