Search Results

Congestion games offer a primary model in the study of pure Nash equilibria in non-cooperative games, and a number of generalized models have been proposed in the literature. One line of generalization includes weighted congestion games, in which ...

Quick and vast development of the Internet of Things (IoT) applications exhibits varied Quality-of-Service (QoS) requirements. Routing is one of the methods used to build a network capable of providing these requirements. However, traditional ...

The importance of Mobile Edge Computing (MEC) systems has risen due to increasing data volumes from Internet of Things (IoT) devices and connected technologies. These systems place computation power and data storage near the network edge to ...

We study the structural properties of the buffer allocation problem from the fitness landscape perspective. We consider manufacturing flow lines with series–parallel network structure. The machines are supposed to be unreliable, their time to ...

• Local optima fitness is negatively correlated with a distance to the best incumbent.
• The set of local optima cannot be encompassed by a ball of relatively small size.
• The crossover helps GA2 locate high quality local optima in hard ...

In modern cloud-based computing through pooled resources, service providers must ensure resource accessibility. The migration of workloads to the cloud necessitates careful planning, including the provision of a sufficient number of easily ...

A network for the transportation of supplies can be described as a rooted tree with a weight of a degree of congestion for each edge. We take the sum of root-leaf distance (SRD) on a rooted tree as the whole degree of congestion of the tree. Hence,...${}_{}$$$${}^{\mathrm{}}$$$${}_{}$

We study the non-submodular maximization problem, whose objective function can be expressed as the Difference between two Set (DS) functions or the Ratio between two Set (RS) functions. For the cardinality-constrained and unconstrained DS ...

Consider a LCFS-PR M / G / 1 queue and assume that at time t = 0, there are n + 1 customers c 1 , c 2 , . . . , c n + 1 who arrived in that order. In addition, at time t = 0 there is an additional customer c with service requirement x > 0 who ...

The Maximum Bisection Problem (MBP) is a well-known combinatorial optimization problem that has been proven to be NP-hard. The maximum bisection of a graph is the partition of its set of vertices into two subsets with an equal number of vertices, ...

In this article, we propose the integration of a novel reinforcement learning technique into our generic and unified framework. This framework enables any continuous metaheuristic to operate in binary optimization, with the technique in question ...

This paper deals with the Delivery Territory Design Problem (DTDP), a districting problem that often occurs in delivery operations. The goal of the problem is to construct clusters of nodes (territories) such that the maximum diameter of a ...

• Delivery Territory Design minimizes maximum district diameters with load balancing.
• We design a probabilistic VNS (ProbVNS) procedure to solve the DTD problem.
• The Shake procedure diversifies and reduces infeasibility.
• We ...

Budget games were introduced by Drees, Riechers, and Skopalik (2014) as a model of noncooperative games arising from resource allocation problems. Budget games have several similarities to congestion games, one of which is that the matroid ...

We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. It is known for its inherent hardness of approximation. We ...$\mathrm{}\mathrm{}\mathrm{}$$\mathrm{}$$\mathrm{}\mathrm{}\mathrm{}$

This research sets forth and examines a new sequential, competitive location problem. The maximal covering location disruption problem is a zero-sum Stackelberg game comprised of two stages. A leader denies access to at most q out of n possible ...

• Introduces new, relevant game theoretic facility location problem to the literature.
• Formulates a bilevel program for the two-stage, zero-sum, extensive form game.
• Develops two variants each of two heuristic solution methods.
• ...

Let G be a connected graph and $t\ge 1$ a (rational) constant. A t-spanner of G is a spanning subgraph of G in which the distance between any pair of vertices is at most t times its distance in G. We address two problems on spanners. The first one, ...$_{}^{}$$_{}^{}$$_{}^{}$$_{}^{}$$\mathrm{}$$\mathrm{}$$_{}^{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$$_{\mathrm{}}^{}$$_{\mathrm{}}^{}$$_{\mathrm{}}^{}$$_{\mathrm{}}^{}$$_{\mathrm{}}^{}$

In this work, we focus on maximizing the stochastic DS decomposition problem. If the constraint is a uniform matroid, we design an adaptive policy, namely Myopic Parameter Conditioned Greedy, and prove its theoretical guarantee $f(\Theta ({\pi }_k))-(1-c_G)g(\Theta ({\mathrm{...}}_{}\mathrm{}{}^{\mathrm{}}{}_{}^{}{}_{}{}_{}^{}{}_{}$${}_{}^{}{}_{}{\mathbb{}}_{}{}_{}^{}{}_{}$$\frac{\mathrm{}{}^{}}{}$$\mathrm{}{}_{}\mathrm{}{}^{\mathrm{}}{}_{}^{}{}_{}^{}$$\mathrm{}\mathrm{}{}^{\mathrm{}}$$$${\mathbb{}}_{}\mathrm{}{}_{}{\mathrm{}{}^{\mathrm{}}}^{\mathrm{}}{}_{}^{}\mathrm{}{}^{\mathrm{}}{}_{}^{}$

In this paper, we address the vertex-traversing-constrained mixed Chinese postman problem (the VtcMCP problem), which is a further generalization of the Chinese postman problem, and this new problem has many practical applications in real life. ...$$$$$$$$$$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathcal{}$${}^{\mathrm{}}$$\mathcal{}$$\mathrm{}$${}^{\mathrm{}}$$\mathrm{}$

This paper tackles the two-machine chain-reentrant flow shop scheduling problem with the no-wait constraint; we assume that each job passes from the first machine to the second and returns back to the first machine in order to execute its last ...$\mathcal{}$$\mathcal{}$

The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from { ± 1 , 2 , 3 } to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is ...

• Lower and upper bounds for the Signed Double Roman Domination Number (SDRDN) on cubic graphs are strengthened.
• Tight/optimal bounds on the SDRDN are established for specific classes of (sub)cubic graphs.
• A constraint programming ...

We study rectangle stabbing problems in which we are given n axis-aligned rectangles in the plane that we want to stab, that is, we want to select line segments such that for each given rectangle there is a line segment that intersects two ...$\mathrm{}$$$$$