Vector connectivity in graphs
Motivated by challenges related to domination, connectivity, and information propagation in social and other networks, we initiate the study of the VECTOR CONNECTIVITY problem. This problem takes as input a graph G and an integer kv for every vertex v ...
Bicriterion discrete equilibrium network design problem
The budget network design problem and fixed-charge network design problem imply different economic pursuits on travel cost and construction cost and structure these two cost components in different ways. A more general version of these two classic ...
Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
We consider the class of integrated network design and scheduling INDS problems that focus on selecting and scheduling operations that will change the characteristics of a network, while being specifically concerned with the performance of the network ...
On the difficulty of virtual private network instances
The virtual private network design problem has attracted an impressive number of theoretical contributions but, surprisingly, very little computational attempts. This might be due to the fact that the compact formulation proposed in [Altın et al. ...
Cooperative covering problems on networks
In this article, we consider the cooperative maximum covering location problem on a network. In this model, it is assumed that each facility emits a certain "signal" whose strength decays over distance according to some "signal strength function." A ...
A comparison of several models for the hamiltonian p-median problem
The Hamiltonian p-median problem consists of determining p disjoint cycles of minimum total cost covering all vertices of a graph. We present several new and existing models for this problem, provide a hierarchy with respect to the quality of the lower ...
