Now showing items 1-2 of 2
The bi-criteria doubly weighted center-median path problem on a tree [Article]
Given a tree network T with n nodes, let PL be the subset of all discrete paths whose length is bounded above by a prespeciﬁed value L. We consider the location of a path-shaped facility P ∈ PL, where customers are represented ...
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem [Article]
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 ...