Results 271 to 280 of about 8,614,380 (320)
Some of the next articles are maybe not open access.
A DIOPHANTINE EQUATION AND ITS POSITIVE INTEGER SOLUTIONS
JP Journal of Algebra, Number Theory and Applications, 2022Summary: In 2017, the Diophantine equation (*) \(\frac1x + \frac1y + \frac1z = \frac1{3p}\) was preliminarily discussed in [the author and \textit{Jiagui Luo}, AIMS Math. 2, No. 1, 111--127 (2017; Zbl 1425.11061)]. The positive integer solutions of some equations derived from (*) were solved, where \(p= 661\). In this paper, the equation (*) is further
openaire +2 more sources
Finding short integer solutions when the modulus is small
IACR Cryptology ePrint Archive, 2023L. Ducas +2 more
semanticscholar +1 more source
Integer Solutions via Goal Programming to Hierarchical Systems
OPSEARCH, 2000Decision making to a hierarchical system is a difficult task in general, if several levels and large number of decision variables are involved in a system. The difficulty further increases if some or all the decision variables are restricted to discrete values. To this end Goal Programming provides a suitable answer.
Sinha, Surabhi, Biswal, M. P.
openaire +1 more source
CHO DECOMPOSITION OF ONE-HALF INTEGER MONOPOLES SOLUTIONS
International Journal of Modern Physics A, 2013We performed the Cho decomposition of the SU(2) Yang–Mills–Higgs gauge potentials of the finite energy (1) one-half monopole solution and (2) the one and a half monopoles solution into Abelian and non-Abelian components. We found that the semi-infinite string singularity in the gauge potentials is a contribution from the Higgs field of the one-half ...
Teh, Rosy +2 more
openaire +1 more source
EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING
International Journal of Computational Geometry & Applications, 2000Given a rectangle R in the plane and a finite set P of points in its interior, consider the partitions of the surface of R into smaller rectangles. A partition is feasible with respect to P if each point in P lie on the boundary of some rectangle of the partition.
de Meneses, Cláudio N. +1 more
openaire +1 more source
SICOpt: Solution Approach for Nonlinear Integer Stochastic Programming Problems
Journal of Optimization Theory and Applications, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. BERALDI +2 more
openaire +1 more source
Balanced Integer Solutions of Linear Equations
2014We use lattice-based methods in order to get an integer solution of the linear equation \(a_{1}x_{1} + \cdots + a_{n}x_{n} = a_{0},\) which satisfies the bound constraints | x j | ≤ X j . Further we study the corresponding homogeneous linear equation under constraints and finally we apply our method to Knapsack problem.
openaire +1 more source
The solution of an integer quadratic programming problem
USSR Computational Mathematics and Mathematical Physics, 1966Abstract In [1] the problem of integer quadratic programming is examined. We consider below a special case of this problem and construct another algorithm for finding an approximate solution. We give the conditions under which the approximate solution is exact.
openaire +3 more sources
Integer Solutions to Angle Optimization Problems
The College Mathematics Journal, 2022James N. Brawner, Nadou Lawson
openaire +1 more source
Visual Solution of Integer Optimization Problems
2002There is an objective contradiction between the allowable amount of computer researches and the feasibility of getting the optimal result in mathematical integer programming problems. The visual technique is proposed to settle this contradiction by means of the direct user participation in computer researches.
openaire +1 more source