We propose a data envelopment analysis (DEA)-based approach to ranking multi-criteria alternatives. We call it "the area of the efficiency score graph" (AES) approach. Unlike the classical DEA score and Dk measure that counts the number of DMUs (alternatives in DEA terminology) that should be...

Pisinger et al. introduced the concept of ‘aggressive reduction’ for large-scale combinatorial optimization problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact...

This paper presents a combined Facility Location/Network Design Problem which simultaneously considers the location of facilities and the design of its underlying network so as to minimize the maximum customer-facility travel time. The model generalizes the classical p-center problem and has...

In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected, facilities located at both end-points of the selected arcs, and a tour identified so as to maximize the difference...