1707 search results - page 51 / 342 » Early Integer Programming |
4OR
2006
14 years 9 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
AAAI
1998
14 years 11 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
NDSS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bug...
ICALP
1992
Springer
15 years 1 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...