Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
480833 | European Journal of Operational Research | 2011 | 8 Pages |
Abstract
Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. We give a generalization of such family. We prove that our family coincides with the set of rules satisfying an additivity property and a cost monotonicity property. We also provide two new characterizations for the family of obligation rules using the previous properties. In the first one, we add a property of separability; and in the second one, we add core selection.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Gustavo BergantiƱos, Leticia Lorenzo, Silvia Lorenzo-Freire,