Euclidean Minimum Sum-of-Squares Clustering amounts to finding p prototypes by minimizing the sum of the squared Euclidean distances from a set of points to their closest prototype. In recent years related clustering problems have been extensively analyzed under the assumption that the space is...

The economic lot sizing problem with product returns and recovery is an important problem that appears in reverse logistics, and has recently been proved to be NP-hard. In this paper, we suggest a variable neighborhood search (VNS) metaheuristic algorithm for solving this problem. It is the...

This paper presents a new local search approach for solving continuous location problems. The main idea is to exploit the relation between the continuous model and its discrete counterpart. A local search is first conducted in the continuous space until a local optimum is reached. It then...

In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly resolving set with the minimum cardinality. Both are present in many diverse areas, including network discovery and verification, robot...

We present a variable neighborhood search approach for solving the one-commodity pickup-and-delivery travelling salesman problem. It is characterized by a set of customers such that each of the customers either supplies (pickup customers) or demands (delivery customers) a given amount of a...

In this paper we revise and modify an old branch-and-bound method for solving the asymmetric distance–constrained vehicle routing problem suggested by Laporte et al. in 1987. Our modification is based on reformulating distance–constrained vehicle routing problem into a travelling salesman...

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes exist between the new facility and a given set of fixed points (the customers), each mode being represented by a different ℓ <Subscript> p </Subscript> norm. A...</subscript>

The multiprocessor scheduling problem with communication delays that we consider in this paper consists of finding a static schedule of an arbitrary task graph onto a homogeneous multiprocessor system, such that the total execution time (i.e. the time when all tasks are completed) is minimum....

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes exist between the new facility and a given set of fixed points (the customers), each mode being represented by a different ℓ p norm. A...

A number of optimization methods require as a first step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem of constructing dominating sets for problems whose objective is a...