01a Articolo in rivista
-
-
-
-
We introduce the noncooperative fixed charge transportation problem (NFCTP), which is a game-theoretic extension of the fixed charge transportation problem. In the NFCTP, competing players solve coupled fixed charge transportation problems simultaneously. Three versions of the NFCTP are discussed...
-
In this paper, we introduce an inertial projection-type method with different updating strategies for solving quasi-variational inequalities with strongly monotone and Lipschitz continuous operators in real Hilbert spaces. Under standard assumptions, we establish different strong convergence...
-
Visualizing contextual information to a map often comes at the expense of overplotting issues. Especially for use cases with relevant map features in the immediate vicinity of an information to add, occlusion of the relevant map context should be avoided. We present SurgeryCuts, a map manipulation...
-
Software vulnerabilities represent one of the main weaknesses of an Information Technology (IT) system w.r.t. cyber attacks and nowadays consolidated official data, like the Common Vulnerability Exposure (CVE) dictionary, provide precise and reliable details about them. This information, together...
-
A graph G(V, E) is claw-free if no vertex has three pairwise non-adjacent neighbours. The maximum weight stable set (MWSS) problem in a claw-free graph is a natural generalization of the matching problem and has been shown to be polynomially solvable by Minty and Sbihi in 1980. In a remarkable...
-
In this paper we show that a connected {claw, net}-free graph G ( V , E ) with α ( G ) > 3 is the union of a strongly bisimplicial clique Q and at most two clique-strips. A clique is strongly bisimplicial if its neighborhood is partitioned into two cliques which are mutually non-adjacent and a...
-
Consider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging...