Bucket elimination for multiobjective optimization problems

DOI10.1007/s10732-006-6726-yzbMath1125.90046MaRDI QIDQ2506234

Javier Larrosa, Emma Rollon

Publication date: 28 September 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-006-6726-y

zbMATH Keywords

Dynamic programming; Multiobjective optimization; Global constraints; Decomposition methods

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C39: Dynamic programming

Related Items

Enabling local computation for partially ordered preferences, Decision making with multiple objectives using GAI networks, Resolution for Max-SAT, Local Computation Schemes with Partially Ordered Preferences, Constraint Optimization Techniques for Exact Multi-Objective Optimization

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Constraint satisfaction using constraint logic programming
• Multiple criteria optimization: State of the art annotated bibliographic surveys
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Earth observation satellite management
• A dynamic programming approach for consistency and propagation for knapsack constraints
• Bucket elimination: A unifying framework for reasoning
• Nonserial dynamic programming
• Mini-buckets
• Mini-bucket Elimination with Bucket Propagation
• Semiring-based constraint satisfaction and optimization
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004