Generalised Integer Programming Based on Logically Defined Relations

DOI10.1007/11821069_48MaRDI QIDQ5756697zbMATH OpenOpenAlexFDO

Authors Peter Jonsson, Gustav Nordh

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_48

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• Approximability of Integer Programming with Generalised Constraints
• Logic applied to integer programming and integer programming applied to logic
• Logic and integer programming
• Modelling either-or relations in integer programming
• Integer programs for logic constraint satisfaction

Cited in

(5)

• Logic applied to integer programming and integer programming applied to logic
• Approximability of the Maximum Solution Problem for Certain Families of Algebras
• Preprocessing rules for integer programming solutions to the generalised assignment problem
• Bounded Tree-Width and CSP-Related Problems
• Introduction to the Maximum Solution Problem

This page was built for publication: Generalised Integer Programming Based on Logically Defined Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756697)