Abstract
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly, approximation methods become the best option. Mini-bucket elimination (MBE) is a well known approximation method for combinatorial optimization problems. It has a control parameter z that allow us to trade time and space for accuracy. In practice it is the space and not the time that limits the execution with high values of z. In this paper we introduce a set of improvements on the way MBE handles memory. The resulting algorithm dfMBE may be orders of magnitude more efficient. As a consequence, higher values of z can be used which, in turn, yields significantly better bounds. We demonstrate our approach in scheduling, probabilistic reasoning and resource allocation problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4, 199–240 (1999)
Pearl, J.: Probabilistic Inference in Intelligent Systems. Networks of Plausible Inference. Morgan Kaufmann, San Mateo (1988)
Gilbert, D., Backofen, R., Yap, R. (eds.): Constraints: an International Journal (Special Issue on Bioinformatics), vol. 6(2-3). Kluwer, Dordrecht (2001)
Bensana, E., Lemaitre, M., Verfaillie, G.: Earth observation satellite management. Constraints 4(3), 293–299 (1999)
Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operations Research 14(4), 699–719 (1966)
Larrosa, J., Schiex, T.: Solving weighted csp by maintaining arc-consistency. Artificial Intelligence 159, 1–26 (2004)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artificial Intelligence 124, 243–282 (2000)
Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113, 41–85 (1999)
Dechter, R., Rish, I.: Mini-buckets: A general scheme for bounded inference. Journal of the ACM 50, 107–153 (2003)
Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, London (1972)
Larrosa, J.: On the time complexity of bucket elimination algorithms. Technical report, University of California at Irvine (2001)
Kask, K., Dechter, R.: A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129, 91–131 (2001)
Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.: Radio link frequency assignment. Constraints 4, 79–89 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rollon, E., Larrosa, J. (2005). Depth-First Mini-Bucket Elimination. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_42
Download citation
DOI: https://doi.org/10.1007/11564751_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)