1707 search results - page 14 / 342 » Early Integer Programming |
CAV
2009
Springer
14 years 10 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
ENDM
2010
13 years 7 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...
4OR
2006
13 years 10 months ago
2006
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
PPSN
1994
Springer
14 years 1 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
CANDC
2005
ACM
13 years 9 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...