Cost propagation: numerical propagation for optimization problems
Authors: 
Birgit Grohe, Dag WedelinAuthors Info & Claims
Birgit Grohe, Dag WedelinAuthors Info & ClaimsAbstract
We investigate cost propagation for solving combinatorial optimization problems with finite domain variables, expressed as an additive component model. Cost propagation combines ideas from both constraint programming and integer programming into a single approach, where problems are iteratively solved by numerical propagation, with updates for single constraint terms in the component model.
We outline a theory of propagation in terms of equivalent problems with notions of consistency, local optimality, convergence and bounds. We define several different updates and analyze their properties.
Finally, we outline computational experiments on the simple assignment problem, the set partitioning problem, and a crossword puzzle. The experiments illustrate that even without a top level search, cost propagation can by itself solve non-trivial problems, and also be attractive compared to standard methods.
References
[1]
Bertelè, U., Brioschi, F.: Nonserial Dynamic Programming, Mathematics in Science and Engineering. Academic Press, London (1972).
[2]
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003).
[3]
Focacci, F., Lodi, A., Milano, M.: Cost-Based Domain Filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, Springer, Heidelberg (1999).
[4]
Grohe, B.: Cost Propagation - Numerical Propagation for Optimization Problems, Licenciate thesis, Chalmers University of Technology (2007).
[5]
Hummel, R.A., Zucker, S.W.: On the Foundations of Relaxation Labeling Processes. IEEE Trans. on Pattern Analysis and Machine Intelligence 3 (1983).
[6]
Khemmoudj, M.O.I., Bennaceur, H., Nagih, A.: Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, Springer, Heidelberg (2005).
[7]
Larrosa, J., Schiex, T.: Artificial Intelligence 159 (2004).
[8]
Milano, M., Ottosson, G., Refalo, P., Thorsteinsson, E.S.: Global constraints: When Constraint Programming meets Operations Research. INFORMS Journal on Computing, Special Issue on the Merging of Mathematical Programming and Constraint Programming (2001).
[9]
Beasley, J.E.: OR-library, http://people.brunel.ac.uk/mastjjb/jeb/orlib/ assigninfo.html
[10]
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Network of Plausible Inference. Morgan Kaufmann, San Francisco (1988).
[11]
Régin, J.-C.: Cost based Arc Consistency for Global Cardinality Constraints. Constraints, an International Journal 7(3-4) (2002).
[12]
Sellmann, M.: Solving weighted CSP by maintaining are consistency. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 634-647. Springer, Heidelberg (2004).
[13]
Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13(2) (1967).
[14]
Wedelin, D.: Probabilistic Inference, Combinatorial Optimization and the Discovery of Causal Structure from Data, PhD thesis, Dept. of Computing Science, Chalmers University of Technology (1993).
[15]
Wedelin, D.: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Annals of Operations Research 57 (1995).
[16]
Wedelin, D.: The design of a 0-1 integer optimizer and its application in the Carmen system. European Journal of Operations Research 87 (1995).
[17]
Wedelin, D.: Cost Propagation: A generalization of constraint programming for optimization problems. In: Proceedings of CPAIOR 2002 (2002).
- Cost propagation: numerical propagation for optimization problems
Recommendations
Using Constraint Propagation to Bound Linear Programs
We present an approach to compute bounds on the optimal value of linear programs based on constraint propagation. Given a feasible dual solution, we apply constraint propagation to the complementary slackness conditions and, if propagation succeeds to ...
Reverse propagation of McCormick relaxations
Constraint propagation techniques have heavily utilized interval arithmetic while the application of convex and concave relaxations has been mostly restricted to the domain of global optimization. Here, reverse McCormick propagation, a method to ...
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after suitable preprocessing to arbitrary algebraic constraints. The basic new ...
Comments
Information & Contributors
Information
Published In
Sponsors
- ILOG
- Association for Constraint Programming
- National ICT
- Microsoft Research: Microsoft Research
- INRIA: Institut Natl de Recherche en Info et en Automatique
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 20 May 2008
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 5Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jan 2025