Zobrazeno 1 - 10
of 825
pro vyhledávání: '"90C10"'
Autor:
Krämer, Fabius, Laux, Tim
We propose and study a novel efficient algorithm for clustering and classification tasks based on the famous MBO scheme. On the one hand, inspired by Jacobs et al. [J. Comp. Phys. 2018], we introduce constraints on the size of clusters leading to a l
Externí odkaz:
http://arxiv.org/abs/2412.17694
This paper studies three different ways to assign weights to the lattice points of a convex polytope and discusses the algebraic and combinatorial properties of the resulting weighted Ehrhart functions and their generating functions and associated ri
Externí odkaz:
http://arxiv.org/abs/2412.17679
Autor:
Hojny, Christopher, Roy, Cédric
Cutting planes are frequently used for solving integer programs. A common strategy is to derive cutting planes from building blocks or a substructure of the integer program. In this paper, we focus on knapsack constraints that arise from single row r
Externí odkaz:
http://arxiv.org/abs/2412.14919
The evolution of floating-point computation has been shaped by algorithmic advancements, architectural innovations, and the increasing computational demands of modern technologies, such as artificial intelligence (AI) and high-performance computing (
Externí odkaz:
http://arxiv.org/abs/2411.12090
Autor:
Yang, Meijia, Xia, Yong
In this paper, we consider an unconstrained (-1,1)-quadratic fractional optimization in the following form: $\min_{x\in\{-1,1\}^n}~(x^TAx+\alpha)/(x^TBx+\beta)$, where $A$ and $B$, given by their nonzero eigenvalues and associated eigenvectors, have
Externí odkaz:
http://arxiv.org/abs/2411.09190
Autor:
Marko, Jonas, Wachsmuth, Gerd
We investigate a broad class of integer optimal control problems with vector-valued controls and switching regularization using a total variation functional involving the p-norm, which influences the structure of a solution. We derive optimality cond
Externí odkaz:
http://arxiv.org/abs/2411.06856
Autor:
Kunt, Tim
How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We present an integer programming formulation of the n-que
Externí odkaz:
http://arxiv.org/abs/2410.17873
Autor:
Zhu, Meijun
We introduce the concept of negative coefficients in various number-based systems, with a focus on decimal and binary systems. We demonstrate that every binary number can be transformed into a sparse form, significantly enhancing computational speed
Externí odkaz:
http://arxiv.org/abs/2410.10620
Autor:
Medal, Hugh, Affar, Samuel
We study a class of two-stage stochastic programs in which the second stage includes a set of components with uncertain capacity, and the expression for the distribution function of the uncertain capacity includes first-stage variables. Thus, this cl
Externí odkaz:
http://arxiv.org/abs/2409.08403
Autor:
Affar, Samuel, Medal, Hugh
Tri-level defender-attacker game models are a well-studied method for determining how best to protect a system (e.g., a transportation network) from attacks. Existing models assume that defender and attacker actions have a perfect effect, i.e., syste
Externí odkaz:
http://arxiv.org/abs/2409.08385