732 search results - page 32 / 147 » Termination of Integer Linear Programs |
CASES
2006
ACM
14 years 1 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
JAIR
2011
13 years 2 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
4OR
2006
13 years 8 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...
ORL
1998
13 years 7 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
ARC
2009
Springer
14 years 2 months ago
2009
Springer
This paper argues the case for the use of analytical models in FPGA architecture layout exploration. We show that the problem when simplified, is amenable to formal optimization t...