Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Constraint satisfaction using constraint logic programming
Artificial Intelligence - Special volume on constraint-based reasoning
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Fundamentals of algorithmics
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Nonserial Dynamic Programming
Earth Observation Satellite Management
Constraints
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Lower Bounds for Non-binary Constraint Optimization Problems
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
Bound sets for biobjective combinatorial optimization problems
Computers and Operations Research
The practice of approximated consistency for Knapsack constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Artificial Intelligence
Local Computation Schemes with Partially Ordered Preferences
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Multi-objective Russian Doll search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Exploiting problem decomposition in multi-objective constraint optimization
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Decision making with multiple objectives using GAI networks
Artificial Intelligence
Efficient approximation algorithms for multi-objective constraint optimization
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Interactive algorithm for multi-objective constraint optimization
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Multi-objective variable elimination for collaborative graphical games
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE), a well known dynamic programming generic algorithm, from mono-objective to multiobjective optimization. We show that the resulting algorithm, MO-BE, can be applied to true multi-objective problems as well as mono-objective problems with knapsack (or related) global constraints. We also extend mini-bucket elimination (MBE), the approximation form of BE, to multiobjective optimization. The new algorithm MO-MBE can be used to obtain good quality multi-objective lower bounds or it can be integrated into multi-objective branch and bound in order to increase its pruning efficiency. Its accuracy is empirically evaluated in real scheduling problems, as well as in Max-SAT-ONE and biobjective weighted minimum vertex cover problems.