Many combinatorial optimisation problems can be modelled as integer linear programs. We consider a class of generalised integer programs where the constraints are allowed to be taken from a broader set of relations (instead of just being linear inequalities). The set of allowed relations is denned using a many-valued logic and the resulting class of relations have provably strong modelling properties. We give sufficient conditions for when such problems are polynomial-time solvable and we prove that they are APX-hard otherwise. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Jonsson, P., & Nordh, G. (2006). Generalised integer programming based on logically defined relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4162 LNCS, pp. 549–560). Springer Verlag. https://doi.org/10.1007/11821069_48
Mendeley helps you to discover research relevant for your work.