Results 21 to 30 of about 713,469 (282)
On the exponential Diophantine equation mx+(m+1)y=(1+m+m2)z
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 Let m > 1 be a positive integer. We show that the exponential Diophantine equation mx + (m + 1)y = (1 + m + m2)z has only the positive integer solution (x, y, z) = (2, 1, 1) when m ≥ 2.
Alan Murat
doaj +1 more source
The parallel approximability of a subclass of quadratic programming [PDF]
, 1997 In this paper we deal with the parallel approximability of a special class of Quadratic Programming (QP), called Smooth Positive Quadratic Programming. This subclass of QP is obtained by imposing restrictions on the coefficients of the QP instance.
Serna Iglesias, María José +1 more
core +1 more source
Improved integral simplex using decomposition for the set partitioning problem
EURO Journal on Computational Optimization, 2018 Integral simplex using decomposition (ISUD) is a method that efficiently solves set partitioning problems. It is an iterative method that starts from a known integer solution and moves through a sequence of integer solutions, decreasing the cost at each ...
Abdelouahab Zaghrouti +2 more
doaj +1 more source
Open Physics, 2023 A pathological study in the definition of uncertain numbers is carried out, and some solutions are proposed. Fundamental theorems for uncertain discrete fractional and integer order calculus are established.
Shiri Babak +2 more
doaj +1 more source
A Discrete Meta-Control Procedure for Approximating Solutions to Binary Programs
Entropy, 2013 Large-scale binary integer programs occur frequently in many real-world applications. For some binary integer problems, finding an optimal solution or even a feasible solution is computationally expensive.
Zelda B. Zabinsky +2 more
doaj +1 more source
Practical and Secure Solutions for Integer Comparison [PDF]
, 2007 Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, respectively. The output x > y becomes known to both parties. In this paper, we consider a variant of Yao’s problem in which the inputs x, y as well as the output bit x > y are ...
Garay, J. +2 more
openaire +3 more sources
Fuzzy Information and Engineering, 2023 The aim of this paper is to propose an algorithm to solve and enhance a multi-level multi-objective integer quadratic programming problem (MLMOIQPP) under a single-valued Pentagonal Neutrosophic environment applied to the objective functions.
N. M. Bekhit +2 more
doaj +1 more source
Positive integer solutions of certain diophantine equations
Proceedings - Mathematical Sciences, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patel, Bijan Kumar +2 more
openaire +1 more source
Hilbert's 10th Problem for solutions in a subring of Q [PDF]
, 2019 Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many ...
Peszek, Agnieszka, Tyszka, Apoloniusz
core +3 more sources
Sensors, 2023 Carrier phase measurements currently play a crucial role in achieving rapid and highly accurate positioning of global navigation satellite systems (GNSS). Resolving the integer ambiguity correctly is one of the key steps in this process.
Ying-Qing Guo +4 more
doaj +1 more source