In the paper "On the nucleolus of the basic vehicle routing game", Mathemat
ical Programming 72, 83-100 (1996), Gothe-Lundgren et al. develop a constra
int generation method to compute the pre-nucleolus of a game. Their method
assumes that constraints that are redundant in the representation of the co
re can be ignored in the computation of the pre-nucleolus. We provide an ex
ample that shows chat for a game with an empty core such an assumption is,
in general, not valid. Further, we show that a statement made by Gothe-Lund
gren et al. about an intuitive interpretation of the pre-nucleolus is misle
ading.