Related papers: Hub location problems with asymmetric allocation
We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set $S$ of commodities. Ravi and Sinha (SODA'04) introduced the model as the…
Hub location problems have multiple applications in logistic systems, airways industry, supply chain network design, and telecommunication. In the hub location problem, a number of nodes should be selected as the hub nodes to act as the…
The Flow Refueling Location Problem (FRLP) is a stylized model for determining the optimal placement of refueling stations for vehicles with limited travel ranges, such as hydrogen fuel cell vehicles and electric vehicles. A notable…
Motivated by scheduling in Geo-distributed data analysis, we propose a target location problem for multi-commodity flow (LoMuF for short). Given commodities to be sent from their resources, LoMuF aims at locating their targets so that the…
In this paper, we show how a resource allocation problem can be solved through Integer Linear Programming (ILP). A detailed illustrative example is presented, together with an exhaustive overview of the mathematical model. The size of the…
This work proposes and studies the distributed resource allocation problem in asynchronous and stochastic settings. We consider a distributed system with multiple workers and a coordinating server with heterogeneous computation and…
In many machine learning applications, it is necessary to meaningfully aggregate, through alignment, different but related datasets. Optimal transport (OT)-based approaches pose alignment as a divergence minimization problem: the aim is to…
Query workloads and database schemas in OLAP applications are becoming increasingly complex. Moreover, the queries and the schemas have to continually \textit{evolve} to address business requirements. During such repetitive transitions, the…
Several high-throughput distributed data-processing applications require multi-hop processing of streams of data. These applications include continual processing on data streams originating from a network of sensors, composing a multimedia…
Resource allocation problems in many computer systems can be formulated as mathematical optimization problems. However, finding exact solutions to these problems using off-the-shelf solvers in an online setting is often intractable for…
Consolidation of loose packages into transport units is a fundamental activity offered by logistics service-providers. Moving the transport units instead of loose packages is faster (with one movement only, multiple packages are loaded…
This paper explores a GIS-based application of the conditional p-median problem (where p = 1) in last-mile delivery logistics. The rapid growth of e-commerce in Pakistan has primarily benefited logistics companies, which face the challenge…
This paper studies the resource allocation algorithm design for multiuser coordinated multipoint (CoMP) networks with simultaneous wireless information and power transfer (SWIPT). In particular, remote radio heads (RRHs) are connected to a…
Regarding the concepts of urban management, digital transformation, and smart cities, various issues are presented. Currently, we like to attend to location allocation problems that can be a new part of digital transformation in urban…
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers respecting a given order of retrieval. While the problem is known…
In the distributed localization problem (DLP), $n$ anonymous robots (agents) $a_0, a_1, ..., a_{n-1}$ begin at arbitrary positions $p_0, ..., p_{n-1}$ in $S$, where $S$ is an Euclidean space. The primary goal in DLP is for agents to reach a…
We propose exact solution approaches for a lateral transhipment problem which, given a pre-specified sequence of customers, seeks an optimal inventory redistribution plan considering travel costs and profits dependent on inventory levels.…
This paper introduces a general modeling framework for a multi-type maximal covering location problem in which the position of facilities in different metric spaces are simultaneously decided to maximize the demand generated by a set of…
This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed…
In traditional assembly lines, it is reasonable to assume that task execution times are the same for each worker. However, in sheltered work centres for disabled this assumption is not valid: some workers may execute some tasks considerably…