Sciweavers

1274 search results - page 45 / 255
» N-fold integer programming
Sort
View
CASES
2006
ACM
14 years 3 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
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 ...
Rachid Seghir, Vincent Loechner
JAIR
2011
123views more  JAIR 2011»
13 years 4 months ago
The Complexity of Integer Bound Propagation
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...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
CORR
2007
Springer
68views Education» more  CORR 2007»
13 years 10 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
IPCO
2010
174views Optimization» more  IPCO 2010»
13 years 11 months ago
On Lifting Integer Variables in Minimal Inequalities
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
Amitabh Basu, Manoel B. Campêlo, Michele Con...
IPCO
2008
188views Optimization» more  IPCO 2008»
13 years 11 months ago
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
Adam N. Letchford, Michael M. Sørensen