Abstract. We present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that we use fast approximate solutions to these linear programs instead of exact but slower solutions. We present computational results with the Steiner tree and Max-Cu...

We consider a generalization of the Connected Facility Location problem (ConFL), suitable to model real world network extension scenarios such as fiber-tothe-curb. In addition to choosing a set of facilities and connecting them by a Steiner tree as in ConFL, we aim to maximize the resulting profit by potentially supplying only a subset of all customers. Furthermore, capacity constraints on pote...

In this work we present a global optimization algorithm for solving a class of large-scale nonconvex optimization models that have a decomposable structure. Such models are frequently encountered in two-stage stochastic programming problems, engineering design, and also in planning and scheduling. A generic formulation and reformulation of the decomposable models is given. We propose a speciali...

We consider a network design problem that arises in the costoptimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem We refer to it as the Capacitated Con...

called the triangle inequalities. The paper deals with the problem of finding efficient algorithms to optimize a linear function over such a polytope. We briefly mention two reasons to seek for an efficient way to optimize a linear function over M(G). 1. The polytope M(G), for |V | > 4, properly contains the cut polytope associated with G (see, e.g., [5] for the details). Thus, if an edge cost ...