Abstract
Solving constraint optimization problems is computationally so expensive that it is often impossible to provide a guaranteed optimal solution, either when the problem is too large, or when time is bounded. In these cases, local search algorithms usually provide good solutions. However, and even if an optimality proof is unreachable, it is often desirable to have some guarantee on the quality of the solution found, in order to decide if it is worthwile to spend more time on the problem.
This paper is dedicated to the production of intervals, that bound as precisely as possible the optimum of Valued Constraint Satisfaction Problems (VCSP). Such intervals provide an upper bound on the distance of the best available solution to the optimum i.e., on the quality of the optimization performed. Experimental results on random VCSPs and real problems are given.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Aarts and J. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, 1997.
C. Bessière and J.C. Régin. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?). In Proc. of the 2nd International Conference on Principles and Practice of Constraint Programming (CP-96, LNCS 1118), pages 61–75, Cambridge, MA, USA, 1996.
S. Bistarelli, U. Montanari, and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 624–630, Montréal, Canada, 1995.
CELAR. Radio Link Frequency Assignment Problem Benchmark. URL ftp://ftp.cs.unh.edu/pub/csp/archive/code/benchmarks, 1994. See also http://wwwbia.inra.frlT/schiex or http://www.cert.fr/francais/deri/verfaillie/oc.html.
P Dago and G. Verfaillie. Nogood Recording for Valued Constraint Satisfaction Problems. In Proc. of the 8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-96), pages 132–139, Toulouse, France, 1996.
R. Dechter. Enhancement Schemes for Constraint Processing: Backjumping, Learning and Cutset Decomposition. Artificial Intelligence, 41(3):273–312,1990.
E. Freuder. Synthesizing Constraint Expressions. Communications of the ACM, 21:958–966, 1978.
E. Freuder and R. Wallace. Partial Constraint Satisfaction. Artificial Intelligence, 58:21–70, 1992.
R. Korf. Depth-First Iterative Deepening: An Optimal Admissible Tree Search. Artificial Intelligence, 27:97–109,1985.
J. Larrosa and P. Meseguer. Expoiting the Use of DAC in MAX-CSP. In Proc. of the 2nd International Conference on Principles and Practice of Constraint Programming (CP-96, LNCS 1118), pages 308–322, Cambridge, MA, USA, 1996.
J. Larrosa and P Meseguer. Phase Transition in MAX-CSP. In Proc. of the 12th European Conference on Artificial Intelligence (ECAI-96), pages 190–194, Budapest, Hungary, 1996.
A. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.
G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons,1988.
J. Pearl. HEURISTICS, Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Company, 1984.
D. Sabin and E. Freuder. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proc. of the 11th European Conference on Artificial Intelligence (ECAI-94), pages 125–129, Amsterdam, The Netherlands, 1994.
T. Schiex, H. Fargier, and G. Verfaillie. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc. of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 631–637, Montrèal, Canada, 1995.
T. Schiex and G. Verfaillie. Nogood Recording for Static and Dynamic Constraint Satisfaction Problems. International Journal ofArtificial Intelligence Tools, 3(2):187–207, 1994.
R. Shrag and D. Miranker. Abstraction and the CSP Phase Transition Boundary. In Proc. of the 4th International Symposium on Artificial Intelligence and Mathematics, pages 138–141, Fort Lauderdale, FL, USA, 1996.
G. Verfaillie, M. Lemaître, and T. Schiex. Russian Doll Search for Solving Constraint Optimization Problems. In Proc. of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 181–187, Portland, OR, USA, 1996.
R. Wallace. Directed Arc Consistency Preprocessing. In Proc. of the ECAI-94 Workshop on Constraint Processing (LNCS 923), pages 121–137. Springer, 1994.
R. Wallace. Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems. In Proc. of the 2nd International Conference on Principles and Practice of Constraint Programming (CP-96, LNCS 1118), pages 482–496, Cambridge, MA, USA, 1996.
M. Wilson and A. Boming. Hierarchical Constraint Logic Programming. Journal of Logic Programming, 16(3):277–318, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Givry, S., Verfaillie, G., Schiex, T. (1997). Bounding the optimum of constraint optimization problems. In: Smolka, G. (eds) Principles and Practice of Constraint Programming-CP97. CP 1997. Lecture Notes in Computer Science, vol 1330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017456
Download citation
DOI: https://doi.org/10.1007/BFb0017456
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63753-0
Online ISBN: 978-3-540-69642-1
eBook Packages: Springer Book Archive