358 search results - page 6 / 72 » GCD of Many Integers |
DM
1998
13 years 7 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
JAIR
2008
13 years 7 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
ENDM
2010
13 years 4 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...