Minimum flow decomposition in graphs with cycles using integer linear programming. [PDF]
J Glob Optim, 2022 Minimum flow decomposition (MFD) — the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow — is a classical problem in Computer Science, and variants of it are powerful models in a different fields such as ...
Dias FHC +3 more
europepmc +2 more sources
The Subspace Flatness Conjecture and Faster Integer Programming [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2023 In a seminal paper, Kannan and Lovász (1988) considered a quantity $\mu_{K L}(\Lambda, K)$ which denotes the best volume-based lower bound on the covering radius $\mu(\Lambda, K)$ of a convex body K with respect to a lattice $\Lambda$.
Victor Reis, Thomas Rothvoss
semanticscholar +1 more source
Computing Sharp Bounds of Metric Based Fractional Dimensions for the Sierpinski Networks
Mathematics, 2022 The concept of metric dimension is widely applied to solve various problems in the different fields of computer science and chemistry, such as computer networking, integer programming, robot navigation, and the formation of chemical structuring.
Arooba Fatima +2 more
doaj +1 more source
Nested Maximum Entropy Designs for Computer Experiments
Mathematics, 2023 Presently, computer experiments with multiple levels of accuracy are widely applied in science and engineering. This paper introduces a class of nested maximum entropy designs for such computer experiments.
Weiyan Mu, Chengxin Liu, Shifeng Xiong
doaj +1 more source
Integer programs with bounded subdeterminants and two nonzeros per row [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row.
S. Fiorini +3 more
semanticscholar +1 more source
The relations between bi-periodic jacobsthal and bi-periodic jacobsthal lucas sequence
Cumhuriyet Science Journal, 2021 In this paper, one of the special integer sequences, Jacobsthal and Jacobsthal Lucas sequences which are encountered in computer science is generalized according to parity of the index of the entries of the sequences, called bi-periodic Jacobsthal and ...
Şükran Uygun
doaj +1 more source
Turning Mathematics Problems into Games: Reinforcement Learning and Gröbner bases together solve Integer Feasibility Problems [PDF]
arXiv.org, 2022 Can agents be trained to answer difficult mathematical questions by playing a game? We consider the integer feasibility problem, a challenge of deciding whether a system of linear equations and inequalities has a solution with integer values.
Yue Wu, J. D. Loera
semanticscholar +1 more source
A Paradigmatic Approach to Find Equal Sum Partitions of Zero-Divisors via Complete Graphs
Journal of Chemistry, 2022 In computer science and mathematics, a partition of a set into two or more disjoint subsets with equal sums is a well-known NP-complete problem. This is a hard problem and referred to as the partition problem or number partitioning.
M. Haris Mateen +4 more
doaj +1 more source
Research on Quantum Annealing Integer Factorization Based on Different Columns
Frontiers in Physics, 2022 The majority of scholars believe that Shor’s algorithm is a unique and powerful quantum algorithm for RSA cryptanalysis, so current postquantum cryptography research has largely considered only the potential threats of Shor’s algorithm.
Baonan Wang, Xiaoting Yang, Dan Zhang
doaj +1 more source
Lower and Upper Bounds of Fractional Metric Dimension of Connected Networks
Fractal and Fractional, 2021 The distance centric parameter in the theory of networks called by metric dimension plays a vital role in encountering the distance-related problems for the monitoring of the large-scale networks in the various fields of chemistry and computer science ...
Muhammad Javaid +5 more
doaj +1 more source