Related papers: The balanced 2-median and 2-maxian problems on a t…
The cable-trench problem is defined as a linear combination of the shortest path and the minimum spanning tree problem. In particular, the goal is to find a spanning tree that simultaneously minimizes its total length and the total path…
We consider the uniform parallel machines scheduling problem in the context of optimistic bilevel optimization, where two speed options are considered. In this scenario, the leader aims to minimize the weighted number of tardy jobs, while…
The weighted $k$-center problem in graphs is a classical facility location problem where we place $k$ centers on the graph, which minimize the maximum weighted distance of a vertex to its nearest center. We study this problem when the…
The p-center problem consists in selecting p centers among M to cover N clients, such that the maximal distance between a client and its closest selected center is minimized. For this problem we propose two new and compact integer…
In this paper we propose the planar obnoxious p-median problem. In the p-median problem the objective is to find p locations for facilities that minimize the weighted sum of distances between demand points and their closest facility. In the…
We consider the $k$-prize-collecting Steiner tree problem. An instance is composed of an integer $k$ and a graph $G$ with costs on edges and penalties on vertices. The objective is to find a tree spanning at least $k$ vertices which…
Within the framework of complex system design, it is often necessary to solve mixed variable optimization problems, in which the objective and constraint functions can depend simultaneously on continuous and discrete variables.…
The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted distance between a facility and a set of demand points. Three…
We obtain an exact formula for the probability that a uniformly random spanning tree of the $2$-by-$n$ square grid is ``balanced'' in the sense that it has an edge whose removal partitions its vertices into two sets of equal size. We…
Distributed optimization is an important direction of research in modern optimization theory. Its applications include large scale machine learning, distributed signal processing and many others. The paper studies decentralized min-max…
This paper is motivated by real-life applications of bi-objective optimization. Having many non dominated solutions, one wishes to cluster the Pareto front using Euclidian distances. The p-center problems, both in the discrete and…
We present a method for solving service allocation problems in which a set of services must be allocated to a set of agents so as to maximize a global utility. The method is completely distributed so it can scale to any number of services…
Collaborative edge computing addresses the resource constraints of individual edge nodes by enabling resource sharing and task co-processing across multiple nodes. To fully leverage the advantages of collaborative edge computing, joint…
This paper investigates structure-preserving $H_2$-optimal model order reduction (MOR) for linear systems with quadratic outputs. Within a Petrov-Galerkin projection framework, the $H_2$-optimal MOR problem is first formulated as an…
We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint…
Device-to-device (D2D) communications is expected to be a critical enabler of distributed computing in edge networks at scale. A key challenge in providing this capability is the requirement for judicious management of the heterogeneous…
Edge computing has emerged as a key technology to reduce network traffic, improve user experience, and enable various Internet of Things applications. From the perspective of a service provider (SP), how to jointly optimize the service…
We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over…
We consider the indirect covering subtree problem (Kim et al., 1996). The input is an edge weighted tree graph along with customers located at the nodes. Each customer is associated with a radius and a penalty. The goal is to locate a…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of…