2976 search results - page 77 / 596 » On the bounded integer programming |
73
Voted
CPC
2008
15 years 17 days ago
2008
![B2[ g] Sets and a Conjecture of Schinzel and Schmidt](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "B2[ g] Sets and a Conjecture of Schinzel and Schmidt")
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
EJC
2007
15 years 13 days ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
117
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
123
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
96
Voted
CORR
2006
Springer
15 years 15 days ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...