When deciding where to locate facilities (eg, emergency points where an ambulance will
wait for a call) that provide a service, it happens quite often that a customer (eg, a person) …

When deciding where to locate facilities (eg, emergency points where an ambulance will
wait for a call) that provide a service, it happens quite often that a customer (eg, a person) …

The multi-vehicle covering tour problem (m-CTP) involves finding a minimum-length set of
vehicle routes passing through a subset of vertices, subject to constraints on the length of …

This paper studies a general class of interdiction problems in which the solution space of
both the leader and follower are characterized by two discrete sets denoted the leader's …

Given a vector y∈ ℝ n and a matrix H∈ ℝ n× m, the sparse approximation problem Ƥ 0/p
asks for a point x such that|| y-Hx|| p≤ α, for a given scalar α, minimizing the size of the …

The close‐enough arc routing problem has an interesting real‐life application to routing for
meter reading. In this article, we propose a new mathematical formulation for this problem …

Given a bipartite graph with bipartition V and W, a cover is a subset C ⊆ V such that each
node of W is adjacent to at least one node in C. The set covering problem seeks a minimum …

We study a discrete version of the classical classification problem in Euclidean space, to be
called the geodesic classification problem. It is defined on a graph, where some vertices are …

Given a ground-set of elements and a family of subsets, the set covering problem consists in
choosing a minimum number of elements such that each subset contains at least one of the …

In this paper we present an extended formulation for the dominating set polytope via facility
location. We show that with this formulation we can describe the dominating set polytope for …