Zobrazeno 1 - 10
of 4 848
pro vyhledávání: '"Pardalos, P. 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
For $k, n \geq 0$, and $c \in Z^n$, we consider ILP problems \begin{gather*} \max\bigl\{ c^\top x \colon A x = b,\, x \in Z^n_{\geq 0} \bigr\}\text{ with $A \in Z^{k \times n}$, $rank(A) = k$, $b \in Z^{k}$ and} \max\bigl\{ c^\top x \colon A x \leq b
Externí odkaz:
http://arxiv.org/abs/2405.17001
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
Autor:
Sadeghi, Zahra, Alizadehsani, Roohallah, Cifci, Mehmet Akif, Kausar, Samina, Rehman, Rizwan, Mahanta, Priyakshi, Bora, Pranjal Kumar, Almasri, Ammar, Alkhawaldeh, Rami S., Hussain, Sadiq, Alatas, Bilal, Shoeibi, Afshin, Moosaei, Hossein, Hladik, Milan, Nahavandi, Saeid, Pardalos, Panos M.
XAI refers to the techniques and methods for building AI applications which assist end users to interpret output and predictions of AI models. Black box AI applications in high-stakes decision-making situations, such as medical domain have increased
Externí odkaz:
http://arxiv.org/abs/2304.01543
Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset induces a connected subgraph. Furthermore, if every other node has at
Externí odkaz:
http://arxiv.org/abs/2301.09247
Survey of Methods for Solving Systems of Nonlinear Equations, Part II: Optimization Based Approaches
Autor:
Kotsireas, Ilias S., Pardalos, Panos M., Semenov, Alexander, Trevena, William T., Vrahatis, Michael N.
This paper presents a comprehensive survey of methods which can be utilized to search for solutions to systems of nonlinear equations (SNEs). Our objectives with this survey are to synthesize pertinent literature in this field by presenting a thoroug
Externí odkaz:
http://arxiv.org/abs/2208.08532