A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints

We study the relation between the linear programming relaxation of two classes of models for the Steiner tree problem with hop constraints. One class is characterized by having hop-indexed arc variables. Although such models have proved to have a very strong linear programming bound, they are not easy to use because of the huge number of variables. This has motivated some studies with models involving fewer variables that use, instead of the hop-indexed arc variables, hop-indexed node variables. In this article, we contextualize the linear programming relaxation of these node-based models in terms of the linear programming relaxation of known arc-based models. We show that the linear programming relaxation of a general node-based model is implied by the linear programming relaxation of a straightforward arc-based model.

Automated summary

This article explores the relation between the linear programming relaxation of two classes of models for the Steiner tree problem with hop constraints, and finds that the linear programming relaxation of node-based models is implied by the linear programming relaxation of arc-based models.