In the paper Li et al. [A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem. Omega 2012;40:210–7] it is claimed that a theoretical result appeared in Montemanni and Gambardella [Exact algorithms for the minimum power symmetric connectivity problem in...

We address the Capacitated m-Ring-Star Problem in which the aim is to find m rings (simple cycles) visiting a central depot, a subset of customers and a subset of potential (Steiner) nodes, while customers not belonging to any ring must be “allocated” to a visited (customer or Steiner) node....

Today’s Transparent Optical Networks (TONs) are highly vulnerable to various physical-layer attacks, such as high-power jamming, which can cause severe service disruption or even service denial. The transparency of TONs enables certain attacks to propagate through the network, not only...

One of the main services of National Statistical Agencies (NSAs) for the current Information Society is the dissemination of large amounts of tabular data, which is obtained from microdata by crossing one or more categorical variables. NSAs must guarantee that no confidential individual...

In this paper we investigate the hospital bed management problem. Constrained by budgetary cuts, French hospitals must efficiently manage shared resources, especially beds, which are allocated to acute and elective patients. Nurses therefore have to manage beds and to plan their use according to...