Repositorio de producción científica de la Universidad de Sevilla

Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

Opened Access Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Puerto Albandoz, Justo
Tamir, Arie
Perea Rojas-Marcos, Federico
Departamento: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Fecha: 2012-05
Publicado en: Discrete Applied Mathematics, 160 (7-8), 970-979.
Tipo de documento: Artículo
Resumen: In this paper we introduce and analyze new classes of cooperative games related to facility location models. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its members. Specifically, the cost in our games is the service diameter of the coalition. We study the existence of core allocations for these games, focusing on network spaces, i.e., finite metric spaces induced by undirected graphs and positive edge lengths.
Cita: Puerto Albandoz, J., Tamir, A. y Perea Rojas-Marcos, F. (2012). Cooperative location games based on the minimum diameter spanning Steiner subgraph problem. Discrete Applied Mathematics, 160 (7-8), 970-979.
Tamaño: 215.9Kb
Formato: PDF

URI: http://hdl.handle.net/11441/42753

DOI: http://dx.doi.org/10.1016/j.dam.2011.07.020

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones