12 search results - page 1 / 3 » The Minimised Geometric Buchberger Algorithm: An Optimal Alg... |
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
13 years 8 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
CONSTRAINTS
2011
12 years 8 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
CADE
2005
Springer
14 years 4 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
JAR
2006
13 years 4 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ISCAS
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...