Sciweavers

307 search results - page 9 / 62
» On Equations over Sets of Integers
Sort
View
IPL
2008
95views more  IPL 2008»
14 years 11 months ago
Approximating maximum satisfiable subsystems of linear equations of bounded width
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
Zeev Nutov, Daniel Reichman
CP
2006
Springer
15 years 2 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
CAV
2009
Springer
187views Hardware» more  CAV 2009»
15 years 11 months ago
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
Nathan Kitchen, Andreas Kuehlmann
CODCRY
2009
Springer
121views Cryptology» more  CODCRY 2009»
15 years 5 months ago
On Weierstrass Semigroups of Some Triples on Norm-Trace Curves
In this paper, we consider the norm-trace curves which are defined by the equation yqr−1 + yqr−2 + · · · + y = x qr−1 q−1 over IFqr where q is a power of a prime number...
Gretchen L. Matthews
MP
2008
99views more  MP 2008»
14 years 11 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey