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

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

 

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

Show item statistics
Icon
Export to
Author: Puerto Albandoz, Justo
Tamir, Arie
Perea Rojas-Marcos, Federico
Department: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Date: 2012-05
Published in: Discrete Applied Mathematics, 160 (7-8), 970-979.
Document type: Article
Abstract: 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.
Cite: 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.
Size: 215.9Kb
Format: PDF

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

DOI: 10.1016/j.dam.2011.07.020

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)