This paper extends the works by Olesen and Petersen (2003), Russell and Schworm (2006) and Cooper et al. (2007) about describing the efficient frontier of a production possibility set by the intersection of a finite number of closed halfspaces, in several ways. First, we decompose the efficient...

A Location-Routing Problem (LRP) combines two difficult problems, facility location and vehicle routing, and as such it is inherently hard to solve. In this paper, we propose a different formulation approach than the common arc-based product-flow (Arc-BPF) approach in the literature. We...

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...

In real life distribution of goods, relatively long service times may make it difficult to serve all requests during regular working hours. These difficulties are even greater if the beginning of the service in each demand site must occur within a time window and violations of routing time...