Results 31 to 40 of about 8,614,380 (320)
A parametric integer programming algorithm for bilevel mixed integer programs [PDF]
, 2009 We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer programming, we present polynomial time algorithms for pure and mixed integer ...
A. Barvinok +23 more
core +5 more sources
Study on the variable coefficient space–time fractional Korteweg de Vries equation
Ain Shams Engineering Journal, 2018 In this paper, the fractional Riccati method is modified for solving nonlinear variable coefficients fractional differential equations involving modified Riemann–Liouville derivative.
Emad A-B. Abdel-Salam, Gamal F. Hassan
doaj +1 more source
Axioms, 2022 We enhance Frobenius’ method for solving linear ordinary differential equations about regular singular points. Key to Frobenius’ approach is the exploration of the derivative with respect to a single parameter; this parameter is introduced through the ...
Ramses van der Toorn
doaj +1 more source
Equal sums of like polynomials [PDF]
, 2005 Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established.
Browning, T. D.
core +1 more source
An exact method for a discrete multiobjective linear fractional optimization [PDF]
, 2007 Integer linear fractional programming problem with multiple objective MOILFP is an important field of research and has not received as much attention as did multiple objective linear fractional programming.
Chergui, M. E-A, Moulai, M.
core +2 more sources
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
Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? [PDF]
Fundamenta Informaticae, 2009 Let En = {xi = 1; xi + xj = xk; xi · xj = xk : i; j; k ∈ {1,...,n}}. We conjecture that if a system $S \subseteq E_n$ has only finitely many solutions in integers x1,...,xn, then each such solution (x1,...,xn) satisfies |x1|,...,|xn| ≤ 22n−1.
A. Tyszka
semanticscholar +1 more source
Fractal and Fractional, 2022 This study aims to identify soliton structures as an inherent fractional discrete nonlinear electrical transmission lattice. Here, the analysis is founded on the idea that the electrical properties of a capacitor typically contain a non-integer-order ...
Hassan Almusawa, Adil Jhangeer
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
Exact solution of the two-axis countertwisting Hamiltonian [PDF]
, 2016 It is shown that the two-axis countertwisting Hamiltonian is exactly solvable when the quantum number of the total angular momentum of the system is an integer after the Jordan-Schwinger (differential) boson realization of the SU(2) algebra.
Draayer, Jerry P. +2 more
core +2 more sources