Approximability of Integer Programming with Generalised Constraints

Details Approximability of Integer Programming with Generalised Constraints Approximability of Integer Programming with Generalised Constraints

2006-02-13

arxiv.org/abs/cs/0602047v3

Computer Science

Computational Complexity

Due to a flaw in a proof result 1 has changed. For maximal constraint languages we now prove a classification result for domai

Scientific paper

We study a family of problems, called \prob{Maximum Solution}, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subject to a set of constraints. When the domain is Boolean (i.e. restricted to $\{0,1\}$), the maximum solution problem is identical to the well-studied \prob{Max Ones} problem, and the approximability is completely understood for all restrictions on the underlying constraints [Khanna et al., SIAM J. Comput., 30 (2001), pp. 1863-1920]. We continue this line of research by considering domains containing more than two elements. We present two main results: a complete classification for the approximability of all maximal constraint languages over domains of cardinality at most 4, and a complete classification of the approximability of the problem when the set of allowed constraints contains all permutation constraints. Under the assumption that a conjecture due to Szczepara holds, we give a complete classification for all maximal constraint languages. These classes of languages are well-studied in universal algebra and computer science; they have, for instance, been considered in connection with machine learning and constraint satisfaction. Our results are proved by using algebraic results from clone theory and the results indicates that this approach is very powerful for classifying the approximability of certain optimisation problems.

Affiliated with

Also associated with

No associations

Rating

Approximability of Integer Programming with Generalised Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximability of Integer Programming with Generalised Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximability of Integer Programming with Generalised Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-167068