89 search results - page 4 / 18 » Upper Bounds on the Number of Solutions of Binary Integer Pr... |
CC
2004
Springer
13 years 10 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
IOR
2011
12 years 12 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
AOR
2010
13 years 2 months ago
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
CINQ
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
ISMVL
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper considers representations for elementary functions such as polynomial, trigonometric, logarithmic, square root, and reciprocal functions. These real valued functions ar...