Zobrazeno 1 - 10
of 1 794
pro vyhledávání: '"PARDALOS, Panos M."'
The double interdiction problem on trees (DIT) for the sum of root-leaf distances (SRD) has significant implications in diverse areas such as transportation networks, military strategies, and counter-terrorism efforts. It aims to maximize the SRD by
Externí odkaz:
http://arxiv.org/abs/2407.13391
This paper provides a thorough exploration of the absolute value equations $Ax-|x|=b$, a seemingly straightforward concept that has gained heightened attention in recent years. It is an NP-hard and nondifferentiable problem and equivalent with the st
Externí odkaz:
http://arxiv.org/abs/2404.06319
In this paper, we study the nurse rostering problem that considers multiple units and many soft time-related constraints. An efficient branch and price solution approach that relies on a fast algorithm to solve the pricing subproblem of the column ge
Externí odkaz:
http://arxiv.org/abs/2311.05438
We study the restricted inverse optimal value problem on linear programming under weighted $l_1$ norm (RIOVLP $_1$). Given a linear programming problem $LP_c: \min \{cx|Ax=b,x\geq 0\}$ with a feasible solution $x^0$ and a value $K$, we aim to adjust
Externí odkaz:
http://arxiv.org/abs/2308.10563
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, w
Externí odkaz:
http://arxiv.org/abs/2307.16392