Results 11 to 20 of about 683,541 (259)
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, T. Rothvoss
semanticscholar +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
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming [PDF]
arXiv.org, 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 ...
Fernando H. C. Dias +3 more
semanticscholar +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.
Samuel Fiorini +3 more
semanticscholar +1 more source
Accurate Flow Decomposition via Robust Integer Linear Programming
bioRxiv, 2023 Minimum flow decomposition (MFD) is a common problem across various fields of Computer Science, where a flow is decomposed into a minimum set of weighted paths.
Fernando H. C. Dias +1 more
semanticscholar +1 more source
PeerJ Computer Science, 2022 Task scheduling helps to improve the resource efficiency and the user satisfaction for Device-Edge-Cloud Cooperative Computing (DE3C), by properly mapping requested tasks to hybrid device-edge-cloud resources.
Bo Wang +4 more
semanticscholar +1 more source
Black-box mixed-variable optimisation using a surrogate model that satisfies integer constraints [PDF]
GECCO Companion, 2020 A challenging problem in both engineering and computer science is that of minimising a function for which we have no mathematical formulation available, that is expensive to evaluate, and that contains continuous and integer variables, for example in ...
Laurens Bliek, S. Verwer, M. D. Weerdt
semanticscholar +1 more source
Local Fractional Metric Dimensions of Rotationally Symmetric and Planar Networks
IEEE Access, 2020 Mathematical modeling, coding or labeling with the help of numeric numbers based on the parameter of distance plays a vital role in the studies of the structural properties of the networks such as accessibility, centrality, clustering, complexity ...
Jia-Bao Liu +2 more
doaj +1 more source
Local Fractional Strong Metric Dimension of Certain Complex Networks
Complexity, 2023 Fractional variants of distance-based parameters have application in the fields of sensor networking, robot navigation, and integer programming problems.
Faiza Jamil +3 more
doaj +1 more source
A generalisation of two partition theorems of Andrews [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur’s celebrated partition identity (1926). Andrews’ two generalisations of Schur’s theorem went on to become two of the most influential results in ...
Jehanne Dousse
doaj +1 more source