Bucket elimination for multiobjective optimization problems

Journal of Heuristics

Volumn 12, Issue 4-5, 2006, Pages 307-328

  Rollón, Emma ^a   Larrosa, Javier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Decomposition methods; Dynamic programming; Global constraints; Multiobjective optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; REAL TIME SYSTEMS; SCHEDULING;

DECOMPOSITION METHODS; GLOBAL CONSTRAINTS; MULTIOBJECTIVE OPTIMIZATION; PRUNING EFFICIENCY;

OPTIMIZATION;

EID: 33646563139     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-006-6726-y     Document Type: Conference Paper

References (24)

1. Bensana, E., M. Lemaitre, and G. Verfaillie. (1999). "Earth Observation Satellite Management." Constraints 4(3), 293-299.
2. Bertele, U. and F. Brioschi. (1972). Nonserial Dynamic Programming. Academic Press.
3. Bistarelli, S., H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. (1999). "Semiring-Based CSPs and Valued CSPs: Frameworks, Properties and Comparison." Constraints 4, 199-240.
4. Bistarelli, S., U. Montanari, and F. Rossi. (1997). "Semiring-Based Constraint Satisfaction and Optimization." Journal of the ACM 44(2), 201-236, March.
5. Brassard, G. and P. Bratley. (1995). Fundamentals of Algorithms. Prentice Hall, San Mateo, CA.
6. de Givry, S., G. Verfaillie, and T. Schiex. (1997). "Bounding the Optimum of Constraint Optimization Problems." In Prof. of CP'97., Schloss Hagenberg (Austria). LNCS. Springer Verlag.
7. Dechter, R. (1999). "Bucket Elimination: A Unifying Framework for Reasoning." Artificial Intelligence 113, 41-85.
8. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann, San Francisco.
9. Dechter, Rina and Irina, Rish. (2003). "Mini-Buckets: A General Scheme for Bounded Inference." Journal of the ACM 50(2), 107-153, March.
10. Ehrgott, M. and X. Gandibleux. (2001). "Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems." Lecture Notes in Economics and Mathematical Systems 507, 241-253.
11. Ehrgott, M. and X. Gandibleux. (2002). Multiple Criteria Optimization. State of the Art. Annotated Bibliographic Surveys. Kluwer Academic Publishers.
12. Freuder, E.C. and R.J. Wallace. (1992). "Partial Constraint Satisfaction." Artificial Intelligence 58, 21-70, December.
13. Johnson, D.S. and M. Trick. (1996). "Second Dimacs Implementation Challenge: Cliques. Coloring and Satisfiability." DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS 26.
14. Korf, R. (1985). "Depth-First Iterative-Deepening: An Optimal Admissable Tree search." Artificial Intelligence 27(3), 97-109.
15. Larrosa, Javier and Emma, Rollon. (2004a). "Adaptive Consistency with Capacity Constraints." In Workshop on Modelling and Solving Problems with Constraints. ECAI'04.
16. Larrosa, Javier and Emma, Rollon. (2004b). "Bucket Elimination with Capacity Constraints." In 6th Workshop on Preferences and Soft Constraints. CP '04.
17. Meseguer, P., J. Larrosa, and M. Sanchez. (2001). "Lower Bounds for Non-Binary Constraint Optimization Problems." In CP-2001, pp. 317-331.
18. Neveu, Bertrand and Gilles, Trombettoni. (2003). "When Local Search Goes with the Winners." In 5th Int. Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, CPAIOR 2003.
19. Quimper, C., A. Lopez-Ortiz, P. van Beek, and A. Golynski. (2004). "Improved Algorithms for the Global Cardinality Constraint." In Proc. of the 10th CP, pages 542-556, Toronto (CA). LNCS 3258. Springer Verlag.
20. Regin, J.C. (1994). "A Filtering Algorithm for Constraints of Difference in CSPs." In Proceedings of the 12th AAAI, pp. 362-367.
21. Schiex, T., H. Fargier, and G. Verfaillie. (1995). "Valued Constraint Satisfaction Problems: Hard and Easy Problems." In IJCAI-95, pages 631-637, Montréal, Canada, August.
22. Sellmann, Meinolf. (2003). "Approximated Consistency for Knapsack Constraints." In Proc. of the 9th CP, pages 679-693. LNCS 2833. Springer Verlag.
23. Trick, Michael. (2003). "A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints." Annals of Operations Research 118(118), 73-84.
24. van Hentenryck, P., H. Simonis, and M. Dincbas. (1992). "Constraint Satisfaction Using Constraint Logic Programming," Artificial Intelligence 58, 113-159.