Approximability of Integer Programming with Generalised Constraints

DOI10.1007/11889205_20MaRDI QIDQ3524244zbMATH OpenOpenAlexFDO

Authors Peter Jonsson, Fredrik Kuivinen, Gustav Nordh

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11889205_20

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• MAX ONES Generalized to Larger Domains
• The approximability of MAX CSP with fixed-value constraints
• Approximability of clausal constraints
• Approximability of the Maximum Solution Problem for Certain Families of Algebras
• Introduction to the Maximum Solution Problem

Cited in

(9)

• Preprocessing rules for integer programming solutions to the generalised assignment problem
• Approximability of clausal constraints
• Generalised Integer Programming Based on Logically Defined Relations
• An integer programming approach for solving a generalized version of the Grundy domination number
• A note on aggregating constraints in integer programming
• MAX ONES Generalized to Larger Domains
• Approximability of the Maximum Solution Problem for Certain Families of Algebras
• Generalized Chvátal-Gomory closures for integer programs with bounds on variables
• General purpose heuristics for integer programming. II

This page was built for publication: Approximability of Integer Programming with Generalised Constraints

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