Sciweavers

358 search results - page 36 / 72
» GCD of Many Integers
Sort
View
MOC
1998
102views more  MOC 1998»
13 years 7 months ago
New results in equal sums of like powers
This paper reports on new results for the equation m i=1 ak i = n j=1 bk j , i.e., equal sums of like powers. Since the 1967 Lander, Parkin and Selfridge survey paper [4], few othe...
Randy L. Ekl
IOR
2010
86views more  IOR 2010»
13 years 6 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo
JGT
2010
103views more  JGT 2010»
13 years 6 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
RSA
2010
104views more  RSA 2010»
13 years 6 months ago
Random graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
Geoffrey R. Grimmett, Svante Janson
COCOA
2010
Springer
13 years 5 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...