Results 11 to 20 of about 3,061,238 (284)
On the Number of Nonnegative Solutions to the Inequality a1 +....ar < n [PDF]
, 2010 In this paper, we present a simple and fast method for counting the number of nonnegative integer solutions to the equality a1x1+a2x2+: : :+arxr = n where a1; a2; :::; ar and n are positive integers.
Farzaneh , A. +3 more
core +9 more sources
Integer Solutions Of Linear Equations
, 1997 Definitions and properties of the integer solutions of linear equations.
Smarandache, Florentin
openaire +3 more sources
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G +5 more
core +6 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 +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
On Connectedness of Solutions to Integer Linear Systems
, 2023 An integer linear system (ILS) is a linear system with integer constraints. The solution graph of an ILS is defined as an undirected graph defined on the set of feasible solutions to the ILS. A pair of feasible solutions is connected by an edge in the solution graph if the Hamming distance between them is 1.
Takasugu Shigenobu, Naoyuki Kamiyama
openaire +4 more sources
On solution-free sets of integers
European Journal of Combinatorics, 2017 Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. In this paper we consider the following three general questions: (i) What is the size of the largest $\mathcal{L}$-free subset of $[n]$?
Robert Hancock 0002, Andrew Treglown
openaire +4 more sources
Sparsity of Integer Solutions in the Average Case [PDF]
, 2019 Fixed some typos from the IPCO ...
Timm Oertel +2 more
openaire +4 more sources
Non-convex mixed-integer nonlinear programming : a survey [PDF]
, 2012 A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S +3 more
core +4 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 +4 more sources