Results 11 to 20 of about 8,614,380 (320)
The Support of Integer Optimal Solutions [PDF]
SIAM Journal on Optimization, 2017 The support of a vector is the number of nonzero-components. We show that given an integral $m\times n$ matrix $A$, the integer linear optimization problem $\max\left\{\boldsymbol{c}^T\boldsymbol{x} : A\boldsymbol{x} = \boldsymbol{b}, \, \boldsymbol{x ...
I. Aliev +4 more
semanticscholar +11 more sources
Generating subtour elimination constraints for the TSP from pure integer solutions. [PDF]
Cent Eur J Oper Res, 2017 The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Pferschy U, Staněk R.
europepmc +3 more sources
On integer solutions of Parsell–Vinogradov systems [PDF]
Inventiones mathematicae, 2018 We prove a sharp upper bound on the number of integer solutions of the Parsell–Vinogradov system in every dimension $$d\ge 2$$d≥2.
Shaoming Guo, Ruixiang Zhang
semanticscholar +4 more sources
Open Computer Science, 2018 We define a computable function f from positive integers to positive integers. We formulate a hypothesis which states that if a system S of equations of the forms xi· xj = xk and xi + 1 = xi has only finitely many solutions in non-negative integers x1, .
Tyszka Apoloniusz
doaj +2 more sources
Stationary solutions for integer-valued autoregressive processes [PDF]
International Journal of Mathematics and Mathematical Sciences, 2005 The purpose of this paper is to introduce and develop a family of ℤ+‐valued autoregressive processes of order p (INAR(p)) by using the generalized multiplication ⊙F of van Harn and Steutel (1982). We obtain various distributional and regression properties for these models.
Emad-Eldin A. A. Aly, Nadjib Bouzar
doaj +2 more sources
Sparsity of Integer Solutions in the Average Case [PDF]
Conference on Integer Programming and Combinatorial Optimization, 2019 We examine how sparse feasible solutions of integer programs are, on average. Average case here means that we fix the constraint matrix and vary the right-hand side vectors.
Timm Oertel, Joseph Paat, R. Weismantel
semanticscholar +5 more sources
Nonnegative integer solutions of the equationFn
TURKISH JOURNAL OF MATHEMATICS, 2019 In this study, we solve the Diophantine equation in the title in nonnegative integers $m,n,$ and $a$. The solutions are given by $F_{1}-F_{0}=F_{2}-F_{0}=F_{3}-F_{2}=F_{3}-F_{1}=F_{4}-F_{3}=5^{0}$ and $F_{5}-F_{0}=F_{6}-F_{4}=F_{7}-F_{6}=5.$ Then we give
F. Erduvan, R. Keskin
semanticscholar +2 more sources
Alexandria Engineering Journal, 2016 Exact general solutions for the dynamics of an incompressible viscous fluid with non-integer order derivative without singular kernel are established using the integral transforms.
A.A. Zafar, C. Fetecau
doaj +3 more sources
Walailak Journal of Science and Technology, 2021 In this paper, we explain all non-negative integer solutions for the nonlinear Diophantine equation of type 8x + py = z2 when p is an arbitrary odd prime number and incongruent with 1 modulo 8.
Boorapa SINGHA
doaj +3 more sources
Integer solutions to bankruptcy problems: The IPROP solution
Rendiconti Lincei, Matematica e Applicazioni, 2022 A widely studied problem is that of a bankruptcy, where several agents claim different amounts of a resource, the estate , that is not enough to satisfy all claims. In some occurrences, the estate is made by integer unities: several contributors (among them also the authors) have proposed ...
Fragnelli, Vito, Gastaldi, Fabio
openaire +2 more sources