Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionally, knapsack constraints have been studied with respect to the required and possible set domain representation. For this domain-store efficient filtering algorithms achieving relaxed and approximated consistency are known. In this work, we study the complexity of achieving length-lex and approximated length-lex bounds consistency. We show that these strengthened levels of consistency can still be achieved in (pseudo-)polynomial time. In addition, we devise heuristic algorithms that work efficiently in practice. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Malitsky, Y., Sellmann, M., & Van Hoeve, W. J. (2008). Length-lex bounds consistency for knapsack constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 266–281). https://doi.org/10.1007/978-3-540-85958-1_18
Mendeley helps you to discover research relevant for your work.